scientific article; zbMATH DE number 1947405
From MaRDI portal
Publication:4411371
zbMath1019.68502MaRDI QIDQ4411371
Erik D. Demaine, J. Ian Munro, Alejandro López-Ortiz
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610348.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Dynamically computing approximate frequency counts in sliding window over data stream ⋮ Dynamic range majority data structures ⋮ Mining evolving data streams for frequent patterns ⋮ Compressed dynamic range majority and minority data structures ⋮ Finding modes with equality comparisons ⋮ Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space ⋮ The complexity of the co-occurrence problem ⋮ Continuous monitoring of distributed data streams over a time-based sliding window ⋮ Sleeping on the job: energy-efficient and robust broadcast for radio networks ⋮ Size matters: choosing the most informative set of window lengths for mining patterns in event sequences ⋮ Approximating frequent items in asynchronous data stream over a sliding window ⋮ Mining frequent items in data stream using time fading model ⋮ Identifying correlated heavy-hitters in a two-dimensional data stream ⋮ Fast and accurate mining of correlated heavy hitters ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. ⋮ CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams ⋮ A time optimized scheme for top-\( k\) list maintenance over incomplete data streams ⋮ A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution ⋮ Enumerating Range Modes ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Finding longest increasing and common subsequences in streaming data ⋮ The frequent items problem, under polynomial decay, in the streaming model ⋮ Unnamed Item ⋮ Sampling for passive internet measurement: a review ⋮ Finding frequent items over sliding windows with constant update time ⋮ Range majorities and minorities in arrays ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows ⋮ Distributed mining of time-faded heavy hitters ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Tree path majority data structures ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Unnamed Item
This page was built for publication:
