23 search results - page 3 / 5 » Bounds for Frequency Estimation of Packet Streams |
PODS
2005
ACM
14 years 1 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
ICDE
2012
IEEE
11 years 10 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
IWCMC
2009
ACM
14 years 2 months ago
2009
ACM
This paper presents the application of cognitive algorithm for a stream diffusion in home theatre “5+1 audio” surround applications. We develop a wavelet-based method to effic...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
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...