Back to Search
Start Over
CacheDiff: Fast Random Sampling
- Publication Year :
- 2015
- Publisher :
- arXiv, 2015.
-
Abstract
- We present a sampling method called, CacheDiff, that has both time and space complexity of O(k) to randomly select k items from a pool of N items, in which N is known.
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....0ab44029015e8fdf0ea235ceae4eea19
- Full Text :
- https://doi.org/10.48550/arxiv.1512.00501