Sciweavers

226 search results - page 7 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 9 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
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...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
JACM
2012
11 years 10 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
DEBS
2007
ACM
13 years 11 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
IPPS
2010
IEEE
13 years 5 months ago
Out-of-core distribution sort in the FG programming environment
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
Priya Natarajan, Thomas H. Cormen, Elena Riccio St...
FOCS
2000
IEEE
14 years 3 days ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk