Key points are not available for this paper at this time.
We introduce the problem of sampling from a moving window of recent items from a data stream and develop the chain-sample and priority-sample algorithms for this problem.
Building similarity graph...
Analyzing shared references across papers
Loading...
Babcock et al. (Sun,) studied this question.
synapsesocial.com/papers/6a1c10cd27b545b111a96986 — DOI: https://doi.org/10.5555/545381.545465
Brian Babcock
Stanford University
Mayur Datar
Google (United States)
Rajeev Motwani
University of Southern California
Stanford University
Building similarity graph...
Analyzing shared references across papers
Loading...