Sampling in dynamic data streams and applications
From MaRDI portal
Recommendations
Cited in
(17)- Dynamic graph stream algorithms in \(o(n)\) space
- Efficient sampling of non-strict turnstile data streams
- Adaptive sampling for geometric problems over data streams
- Space-efficient estimation of statistics over sub-sampled streams
- Sampling from Dense Streams without Penalty
- Deterministic sampling and range counting in geometric data streams
- Optimal Random Sampling from Distributed Streams Revisited
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Facility Location in Dynamic Geometric Data Streams
- Optimal sampling from sliding windows
- scientific article; zbMATH DE number 2119720 (Why is no real title available?)
- Weighted sampling without replacement from data streams
- scientific article; zbMATH DE number 7053290 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- A dynamic sampling for monitoring nonparametric multivariate processes
- Streaming Euclidean MST to a constant factor
- Range counting oracles for geometric problems
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 Q5370606)