SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
From MaRDI portal
Recommendations
Cites work
- -nets and simplex range queries
- A guided tour of Chernoff bounds
- Approximating extent measures of points.
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- The space complexity of approximating the frequency moments
- Universal classes of hash functions
Cited in
(18)- Efficient sampling of non-strict turnstile data streams
- Adaptive sampling for geometric problems over data streams
- Sampling from Dense Streams without Penalty
- Deterministic sampling and range counting in geometric data streams
- Optimal Random Sampling from Distributed Streams Revisited
- Streaming Embeddings with Slack
- scientific article; zbMATH DE number 2119720 (Why is no real title available?)
- Improved time and space bounds for dynamic range mode
- Sampling in dynamic data streams and applications
- Perfect \(L_p\) sampling in a data stream
- Approximate F₂-Sketching of Valuation Functions
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Model counting meets \(F_0\) estimation
- Space complexity of Euclidean clustering
- Streaming algorithms for geometric Steiner forest
- Dynamic streaming algorithms for geometric independent set
- Streaming diameter of high-dimensional points
- Dynamic coresets
This page was built for publication: SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521590)
