New algorithms for distributed sliding windows
From MaRDI portal
Publication:5116486
Recommendations
- Distributed streams algorithms for sliding windows
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- Continuous monitoring of distributed data streams over a time-based sliding window
- Algorithms for \(k\)-median clustering over distributed streams
- Effective computations on sliding windows
Cites work
- scientific article; zbMATH DE number 5764835 (Why is no real title available?)
- scientific article; zbMATH DE number 6820208 (Why is no real title available?)
- Algorithms for \(k\)-median clustering over distributed streams
- Clustering on sliding windows in polylogarithmic space
- Clustering problems on sliding windows
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- Effective computations on sliding windows
- Improved algorithms for distributed entropy monitoring
- Optimal Random Sampling from Distributed Streams Revisited
- Tight bounds for distributed functional monitoring
Cited in
(8)- Distributing frequency-dependent data stream computations
- Effective computations on sliding windows
- Almost-smooth histograms and sliding-window graph algorithms
- Continuous monitoring of distributed data streams over a time-based sliding window
- Algorithms for \(k\)-median clustering over distributed streams
- In-network estimation of frequency moments
- On distributing symmetric streaming computations
- Greedily computing associative aggregations on sliding windows
This page was built for publication: New algorithms for distributed sliding windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116486)