Optimal sampling from sliding windows
Authors:
Open Access
- 29 June 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 147-156
Abstract
No abstract availableKeywords
This publication has 48 references indexed in Scilit:
- Counting distinct items over update streamsTheoretical Computer Science, 2007
- On graph problems in a semi-streaming modelTheoretical Computer Science, 2005
- Data Streams: Algorithms and ApplicationsFoundations and Trends® in Theoretical Computer Science, 2005
- No pane, no gainACM SIGMOD Record, 2005
- Operator scheduling in data stream systemsThe VLDB Journal, 2004
- Comparing data streams using hamming norms (how to zero in)IEEE Transactions on Knowledge and Data Engineering, 2003
- Clustering data streams: theory and practiceIEEE Transactions on Knowledge and Data Engineering, 2003
- Testing and Spot-Checking of Data StreamsAlgorithmica, 2002
- Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))ACM Transactions on Mathematical Software, 1994
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985