For a sample X1,..., Xn -> F and suppose that for some t0 we are
interested in computing Pr[t(X)<=t0).
Sketch a "Real World" and "a Bootstrap World" algorithm for computing
this probability.
Implement both algorithms in Splus. Demonstrate and compare their use
for the Hoeges-Lehman measure of location.
Ellen Parzynski
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
-----------------------------------------------------------------------
This message was distributed by s-news@wubios.wustl.edu. To unsubscribe
send e-mail to s-news-request@wubios.wustl.edu with the BODY of the
message: unsubscribe s-news