The following pages link to Finding repeated elements (Q1170891):
Displaying 14 items.
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Mining frequent items in data stream using time fading model (Q498012) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Tree path majority data structures (Q784481) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Finding frequent items over sliding windows with constant update time (Q991773) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- Approximating frequent items in asynchronous data stream over a sliding window (Q1736485) (← links)
- Identifying correlated heavy-hitters in a two-dimensional data stream (Q1741250) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution (Q1750526) (← links)
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size (Q2201636) (← links)
