Maintaining Stream Statistics over Sliding Windows
From MaRDI portal
Recommendations
Cited in
(48)- Space lower bounds for online pattern matching
- Give me some slack: efficient network measurements
- Streaming algorithms for robust submodular maximization
- Sketching asynchronous data streams over sliding windows
- scientific article; zbMATH DE number 2119721 (Why is no real title available?)
- Succinct summing over sliding windows
- scientific article; zbMATH DE number 7559138 (Why is no real title available?)
- On evaluating stream learning algorithms
- Distributed streams algorithms for sliding windows
- Loda: lightweight on-line detector of anomalies
- Continuous monitoring of distributed data streams over a time-based sliding window
- Approximating frequent items in asynchronous data stream over a sliding window
- Spatially-decaying aggregation over a network
- Dynamically computing approximate frequency counts in sliding window over data stream
- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- A general method for estimating correlated aggregates over a data stream
- Efficient error-correcting codes for sliding windows
- Tight bounds for sliding Bloom filters
- Give me some slack: efficient network measurements
- Improved algorithms for polynomial-time decay and time-decay with additive error
- Space Lower Bounds for Online Pattern Matching
- Improved Algorithms for Time Decay Streams
- Greedily computing associative aggregations on sliding windows
- Smoothness of Schatten norms and sliding-window matrix streams
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- Derandomization for sliding window algorithms with strict correctness
- Zero-one laws for sliding windows and universal sketches
- Longest increasing subsequences in sliding windows
- Nearly optimal distinct elements and heavy hitters on sliding windows
- Time-decayed correlated aggregates over data streams
- Effective computations on sliding windows
- Recentness biased learning for time series forecasting
- Randomized sliding window algorithms for regular languages
- Brief announcement: Give me some slack: efficient network measurements
- Boosting distinct random sampling for basic counting on the union of distributed streams
- Computing (and Life) Is All about Tradeoffs
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- A survey on concept drift adaptation
- Almost-smooth histograms and sliding-window graph algorithms
- Automata theory on sliding windows
- Estimating the number of active flows in a data stream over a sliding window
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
- Approximate query processing over static sets and sliding windows
- Dynamic data structures for timed automata acceptance
- Approximate query processing over static sets and sliding windows
- Adversarially robust streaming algorithms via differential privacy
- Indexing for summary queries
This page was built for publication: Maintaining Stream Statistics over Sliding Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785622)
