132 search results - page 4 / 27 » Optimal approximations of the frequency moments of data stre... |
APWEB
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Nowadays, we have witnessed the widely recognized phenomenon of high speed data streams. Various statistics computation over data streams is often required by many applic...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
164
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
CORR
2010
Springer
14 years 6 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...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...