Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Bui, Dai Nguyen
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2183797193
