Reservoir-sampling algorithms of time complexity O(n(1 + log(N/n)))

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Kim-Hung Li Chinese Univ. of Hong Kong, Shatin, N.T., Hong Kong
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 20 Issue 4, Dec. 1994
Pages 481-493
ACM New York, NY, USA
table of contents doi>10.1145/198429.198435
Reservoir-sampling algorithms of time complexity <italic>O</italic>(<italic>n</italic>(1 + log(<italic>N</italic>/<italic>n</italic>))) Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 27
· Downloads (cumulative): 2,664
· Citation Count: 18


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder