The following pages link to (Q4411369):
Displayed 13 items.
- d-k-min-wise independent family of hash functions (Q340570) (← links)
- Certifying equality with limited interaction (Q343864) (← links)
- Computing rarity on uncertain data (Q350968) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- Fingerprints for highly similar streams (Q498399) (← links)
- Exponential time improvement for min-wise based algorithms (Q716331) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- Continuous monitoring of distributed data streams over a time-based sliding window (Q2428698) (← links)
- On b-bit min-wise hashing for large-scale regression and classification with sparse data (Q4558503) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- Improved Algorithms for Time Decay Streams (Q5875480) (← links)