Date: 2005-10-15 23:23:14Analysis of algorithms Randomized algorithm Big O notation Time complexity Expectation–maximization algorithm Pseudo-random number sampling Theoretical computer science Mathematics Applied mathematics | | Random Sampling with a Reservoir JEFFREY SCOTT VITTER Brown University We introduce fast algorithms for selecting a random sample of n records without replacement from a pool of N records, where the value of N is unknownAdd to Reading ListSource URL: www.mathcs.emory.eduDownload Document from Source Website File Size: 1,44 MBShare Document on Facebook
|