Finding frequent items over sliding windows with constant update time
From MaRDI portal
Publication:991773
DOI10.1016/j.ipl.2009.01.027zbMath1209.68661MaRDI QIDQ991773
Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.027
Related Items
How to catch \(L_2\)-heavy-hitters on sliding windows, Approximating frequent items in asynchronous data stream over a sliding window
Cites Work