The following pages link to (Q4411371):
Displaying 30 items.
- Dynamic range majority data structures (Q306716) (← links)
- Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis (Q408650) (← links)
- Mining frequent items in data stream using time fading model (Q498012) (← links)
- CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams (Q506760) (← links)
- Sleeping on the job: energy-efficient and robust broadcast for radio networks (Q644799) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Tree path majority data structures (Q784481) (← links)
- Mining evolving data streams for frequent patterns (Q854217) (← 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)
- Size matters: choosing the most informative set of window lengths for mining patterns in event sequences (Q1715925) (← 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 time optimized scheme for top-\( k\) list maintenance over incomplete data streams (Q1749630) (← links)
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution (Q1750526) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Distributed mining of time-faded heavy hitters (Q2054052) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Continuous monitoring of distributed data streams over a time-based sliding window (Q2428698) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- Sampling for passive internet measurement: a review (Q2503942) (← links)
- Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. (Q5009499) (← links)
- (Q5091063) (← links)
- Enumerating Range Modes (Q6065431) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
