Estimating frequency moments of data streams using random linear combinations
From MaRDI portal
Recommendations
Cited in
(24)- Two improved range-efficient algorithms for \(F_0\) estimation
- Hierarchical sampling from sketches: Estimating functions over data streams
- Applying approximate counting for computing the frequency moments of long data streams
- The value of multiple read/write streams for approximating frequency moments
- An optimal algorithm for large frequency moments using \(O(n^{1-2/k})\) bits
- Taylor polynomial estimator for estimating frequency moments
- The Simultaneous Communication of Disjointness with Applications to Data Streams
- Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
- Estimating Hybrid Frequency Moments of Data Streams
- Optimal approximations of the frequency moments of data streams
- On Estimating Frequency Moments of Data Streams
- Deterministically Estimating Data Stream Frequencies
- A Note on Estimating Hybrid Frequency Moment of Data Streams
- Optimal sampling from sliding windows
- Estimating hybrid frequency moments of data streams
- Revisiting frequency moment estimation in random order streams
- In-network estimation of frequency moments
- Fast moment estimation in data streams in optimal space
- Two Improved Range-Efficient Algorithms for F 0 Estimation
- Streaming algorithms via precision sampling
- An improved data stream algorithm for frequency moments
- Algorithms and Computation
- Sketching, moment estimation, and the Lévy-Khintchine representation theorem
- On-board vehicle data stream monitoring using mine-fleet and fast resource constrained monitoring of correlation matrices
This page was built for publication: Estimating frequency moments of data streams using random linear combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313040)