Algorithms and estimators for summarization of unaggregated data streams
From MaRDI portal
Publication:2453543
Recommendations
Cites work
Cited in
(11)- Space-efficient estimation of statistics over sub-sampled streams
- Loglog counting for IP traffic
- CR-precis: A Deterministic Summary Structure for Update Data Streams
- scientific article; zbMATH DE number 1947405 (Why is no real title available?)
- scientific article; zbMATH DE number 1969714 (Why is no real title available?)
- Estimating the number of active flows in a data stream over a sliding window
- Approximating Multiple Arrival Streams by Using Aggregation
- Perfect \(L_p\) sampling in a data stream
- LATIN 2004: Theoretical Informatics
- Regularisation and central limit theorems for an inverse problem in network sampling applications
- A general method for estimating correlated aggregates over a data stream
This page was built for publication: Algorithms and estimators for summarization of unaggregated data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453543)