Sampling from Dense Streams without Penalty
From MaRDI portal
Publication:2920441
DOI10.1007/978-3-319-08783-2_2zbMATH Open1425.68471OpenAlexW190878004MaRDI QIDQ2920441FDOQ2920441
Authors: Vladimir Braverman, Gregory Vorsanger 
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_2
Recommendations
- Optimal Random Sampling from Distributed Streams Revisited
- Efficient sampling of non-strict turnstile data streams
- Efficient sampling of non-strict turnstile data streams
- Efficient stream sampling for variance-optimal estimation of subset sums
- \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams
- Perfect \(L_p\) sampling in a data stream
- Stream sampling for variance-optimal estimation of subset sums
- Optimal approximations of the frequency moments of data streams
- Sampling in dynamic data streams and applications
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Statistical sampling theory and related topics (62D99)
Cited In (8)
- Space-efficient estimation of statistics over sub-sampled streams
- 1-pass relative-error \(L_p\)-sampling with applications
- Efficient sampling of non-strict turnstile data streams
- Perfect \(L_p\) sampling in a data stream
- Stochastic streams: sample complexity vs. space complexity
- Efficient sampling of non-strict turnstile data streams
- Stream sampling framework and application for frequency cap statistics
- Consistent subset sampling
This page was built for publication: Sampling from Dense Streams without Penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920441)
