Sciweavers

223 search results - page 5 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
15 years 11 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
FOCS
2008
IEEE
15 years 4 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
200
Voted
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
15 years 11 months ago
A Framework for Clustering Massive-Domain Data Streams
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...
Charu C. Aggarwal
DEBS
2007
ACM
15 years 1 months ago
High frequency distributed data stream event correlation to improve neonatal clinical management
Approximately eighteen percent (18%) of babies born in New South Wales (NSW), Australia require special care or neonatal intensive care admission. Premature babies can be up to 17...
Carolyn McGregor, Michael Stacey
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti