Simpler algorithm for estimating frequency moments of data streams
From MaRDI portal
Publication:3581589
DOI10.1145/1109557.1109634zbMath1192.94080OpenAlexW4237741859MaRDI QIDQ3581589
Chandan Saha, Kesh Deepanjan, Sumit Ganguly, Lakshminath Bhuvanagiri
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109634
Related Items (9)
Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ Optimal sampling from sliding windows ⋮ Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ High Probability Frequency Moment Sketches ⋮ Continuous Monitoring of l_p Norms in Data Streams ⋮ Applying approximate counting for computing the frequency moments of long data streams ⋮ Sketching information divergences ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows
This page was built for publication: Simpler algorithm for estimating frequency moments of data streams
