Sciweavers

2 search results - page 1 / 1
» Probabilistic lossy counting: an efficient algorithm for fin...
Sort
View
CCR
2008
94views more  CCR 2008»
13 years 4 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 4 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan