The frequent items problem, under polynomial decay, in the streaming model
From MaRDI portal
(Redirected from Publication:986537)
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
- scientific article; zbMATH DE number 1947405 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 2119721 (Why is no real title available?)
- An improved data stream summary: the count-min sketch and its applications
- Data streams: algorithms and applications.
- Finding repeated elements
- Improved algorithms for polynomial-time decay and time-decay with additive error
- Maintaining time-decaying stream aggregates
- Time-decaying sketches for sensor data aggregation
Cited in
(6)- Fingerprints for highly similar streams
- Improved algorithms for polynomial-time decay and time-decay with additive error
- Theoretical Computer Science
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Fast identification of heavy hitters by cached and packed group testing
- Maintaining time-decaying stream aggregates
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)
