Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
14
click to vote
IMC
2003
ACM
favorite
Email
discuss
report
80
views
Internet Technology
»
more
IMC 2003
»
Identifying frequent items in sliding windows over on-line packet streams
14 years 1 months ago
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
more »
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)
Researcher Info
Internet Technology Study Group
Computer Vision