The frequent items problem, under polynomial decay, in the streaming model
From MaRDI portal
Publication:986537
DOI10.1016/J.TCS.2010.04.029zbMATH Open1196.68348OpenAlexW2019166081MaRDI QIDQ986537FDOQ986537
Authors: Guy Feigenblat, Ofra Itzhaki, Ely Porat 
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.029
Recommendations
- The frequent items problem in online streaming under various performance measures
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Approximating frequent items in asynchronous data stream over a sliding window
- Approximating frequent items in asynchronous data stream over a sliding window
- Mining frequent items in data stream using time fading model
- On Finding Frequent Elements in a Data Stream
Cites Work
- Finding repeated elements
- An improved data stream summary: the count-min sketch and its applications
- Data streams: algorithms and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time-decaying sketches for sensor data aggregation
- Title not available (Why is that?)
- Maintaining time-decaying stream aggregates
- Improved algorithms for polynomial-time decay and time-decay with additive error
Cited In (6)
- Theoretical Computer Science
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Maintaining time-decaying stream aggregates
- Improved algorithms for polynomial-time decay and time-decay with additive error
- Fingerprints for highly similar streams
- Fast identification of heavy hitters by cached and packed group testing
This page was built for publication: The frequent items problem, under polynomial decay, in the streaming model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986537)
