Optimal sampling from sliding windows
From MaRDI portal
Publication:414877
DOI10.1016/J.JCSS.2011.04.004zbMATH Open1242.68081OpenAlexW2031034601MaRDI QIDQ414877FDOQ414877
Recommendations
- Optimal sampling for density estimation in continuous time
- scientific article; zbMATH DE number 513151
- scientific article; zbMATH DE number 4084788
- scientific article; zbMATH DE number 2119720
- Optimal sampling strategies for multiscale stochastic processes
- Optimal sequential sampling from two populations.
- Random sampling in multi-window quasi shift-invariant spaces
- Efficient sampling in approximate dynamic programming algorithms
Cites Work
- scientific article; zbMATH DE number 5764828 (Why is no real title available?)
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- scientific article; zbMATH DE number 2119720 (Why is no real title available?)
- scientific article; zbMATH DE number 2119721 (Why is no real title available?)
- A near-optimal algorithm for computing the entropy of a stream
- An improved data stream algorithm for frequency moments
- An information statistics approach to data stream and communication complexity
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computing and Combinatorics
- Computing diameter in the streaming and sliding-window models
- Data streams. Models and algorithms.
- Data streams: algorithms and applications.
- Database Theory - ICDT 2005
- Distributed streams algorithms for sliding windows
- Estimating Entropy and Entropy Norm on Data Streams
- Maintaining significant stream statistics over sliding windows
- Optimal approximations of the frequency moments of data streams
- Random sampling with a reservoir
- Reservoir-sampling algorithms of time complexity O ( n (1 + log( N / n )))
- Sampling algorithms: lower bounds and applications
- Sampling in dynamic data streams and applications
- Sampling lower bounds via information theory
- Sequential reservoir sampling with a nonuniform distribution
- Simpler algorithm for estimating frequency moments of data streams
- Size-estimation framework with applications to transitive closure and reachability
- Streaming and sublinear approximation of entropy and information distances
- Summarizing data using bottom-\(k\) sketches
- Testing and spot-checking of data streams
- The DLT priority sampling is essentially optimal
- When Random Sampling Preserves Privacy
Cited In (16)
- Title not available (Why is no real title available?)
- Sampling streaming data with replacement
- Continuous sampling from distributed streams
- Title not available (Why is no real title available?)
- Time- and space-efficient sliding window top-k query processing
- Distributed streams algorithms for sliding windows
- Optimal convergence rates of high order Parzen windows with unbounded sampling
- Perfect \(L_p\) sampling in a data stream
- Secure sampling with sublinear communication
- Derandomization for sliding window algorithms with strict correctness
- Derandomization for sliding window algorithms with strict correctness
- Optimal Random Sampling from Distributed Streams Revisited
- Title not available (Why is no real title available?)
- Symmetric norm estimation and regression on sliding windows
- Automata theory on sliding windows
- Parallel streaming random sampling
This page was built for publication: Optimal sampling from sliding windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414877)
