Pages that link to "Item:Q706324"
From MaRDI portal
The following pages link to Distributed streams algorithms for sliding windows (Q706324):
Displaying 16 items.
- Optimal sampling from sliding windows (Q414877) (← links)
- A general method for estimating correlated aggregates over a data stream (Q747615) (← links)
- Succinct summing over sliding windows (Q1741865) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- Sketching asynchronous data streams over sliding windows (Q1954256) (← links)
- Give me some slack: efficient network measurements (Q2272404) (← links)
- Improved algorithms for distributed entropy monitoring (Q2408102) (← links)
- Continuous monitoring of distributed data streams over a time-based sliding window (Q2428698) (← links)
- Improved algorithms for polynomial-time decay and time-decay with additive error (Q2481557) (← links)
- Optimal Random Sampling from Distributed Streams Revisited (Q3095333) (← links)
- (Q4999000) (← links)
- (Q5005134) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- (Q5091046) (← links)
- Dynamically computing approximate frequency counts in sliding window over data stream (Q5291160) (← links)
- Improved Algorithms for Time Decay Streams (Q5875480) (← links)
