Maintaining significant stream statistics over sliding windows

From MaRDI portal

Revision as of 02:50, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3581550

Jump to:navigation, search

DOI10.1145/1109557.1109636zbMath1192.68182OpenAlexW4243245258MaRDI QIDQ3581550

Lap-Kei Lee, Hing-Fung Ting

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109636

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (4)

Optimal sampling from sliding windows ⋮ Continuous monitoring of distributed data streams over a time-based sliding window ⋮ Approximating frequent items in asynchronous data stream over a sliding window ⋮ Succinct summing over sliding windows

This page was built for publication: Maintaining significant stream statistics over sliding windows

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3581550&oldid=16987075"