Mergeable summaries
From MaRDI portal
Publication:2943556
Recommendations
Cited in
(12)- Give me some slack: efficient network measurements
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Frequent directions: simple and deterministic matrix sketching
- Give me some slack: efficient network measurements
- The Communication Complexity of Distributed epsilon-Approximations
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Intermediate value linearizability: a quantitative correctness criterion
- Randomized algorithms for tracking distributed count, frequencies, and ranks
- Summary data structures for massive data
- Indexing for summary queries
This page was built for publication: Mergeable summaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943556)