Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives
Open Access
- 25 June 2019
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 254-268
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- How to catch -heavy-hitters on sliding windowsTheoretical Computer Science, 2014
- Composable core-sets for diversity and coverage maximization2014
- Dynamic Graphs in the Sliding-Window Model2013
- Approximating Frequent Items in Asynchronous Data Stream over a Sliding WindowAlgorithms, 2011
- Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding WindowAlgorithmica, 2011
- Finding top-k elements in a time-sliding windowEvolving Systems, 2010
- Data Streams: Algorithms and ApplicationsFoundations and Trends® in Theoretical Computer Science, 2005
- Finding Graph Matchings in Data Streams2005
- Maintaining Stream Statistics over Sliding WindowsSIAM Journal on Computing, 2002
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985