Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

IMC
2003
ACM

favoriteEmaildiscussreport

80views Internet Technology» more IMC 2003»

Identifying frequent items in sliding windows over on-line packet streams

13 years 9 months ago

Identifying frequent items in sliding windows over on-line packet streams

Download conferences.sigcomm.org

Lukasz Golab, David DeHaan, Erik D. Demaine, Aleja

Real-time Traffic

IMC 2003 |

claim paper

Related Content

» A simpler and more efficient deterministic scheme for finding frequent items over sliding ...

» Mining topk frequent items in a data stream with flexible sliding windows

» A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams

» Continuous Monitoring of Distributed Data Streams over a Timebased Sliding Window

» Discovering Frequent PolyRegions in DNA Sequences

» Fast and accurate computation of equidepth histograms over data streams

» Mining adaptively frequent closed unlabeled rooted trees in data streams

» TimeDecayed Correlated Aggregates over Data Streams

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	IMC
Authors	Lukasz Golab, David DeHaan, Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro

Comments (0)