The Online Event-Detection Problem

24 Dec 2018 Bender Michael A. Berry Jonathan W. Farach-Colton Martin Johnson Rob Kroeger Thomas M. Pandey Prashant Phillips Cynthia A. Singh Shikha

Given a stream $S = (s_1, s_2, ..., s_N)$, a $\phi$-heavy hitter is an item $s_i$ that occurs at least $\phi N$ times in $S$. The problem of finding heavy-hitters has been extensively studied in the database literature... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS