257 search results - page 1 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...