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 v
The main result of the paper is the design and analysis of Algorithm Z it does the sampling in one pass using constant space and in On1 logNn expected time which is optimum up to a constant factor Several optimizations are studied that collectively
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Random Sampling with a Reservoir JEFFREY..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.