A Note on Estimating Hybrid Frequency Moment of Data Streams
From MaRDI portal
Publication:3638451
Recommendations
- Estimating hybrid frequency moments of data streams
- Estimating Hybrid Frequency Moments of Data Streams
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- On Estimating Frequency Moments of Data Streams
- Optimal approximations of the frequency moments of data streams
Cites work
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- An improved data stream summary: the count-min sketch and its applications
- An information statistics approach to data stream and communication complexity
- Estimating Entropy over Data Streams
- Estimating Hybrid Frequency Moments of Data Streams
- Optimal approximations of the frequency moments of data streams
- Optimal space lower bounds for all frequency moments
- Probabilistic counting algorithms for data base applications
- The space complexity of approximating the frequency moments
Cited in
(2)
This page was built for publication: A Note on Estimating Hybrid Frequency Moment of Data Streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638451)