Sciweavers

226 search results - page 11 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
On the tradeoff between playback delay and buffer space in streaming
We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are distributed among a number of clust...
Alix L. H. Chow, Leana Golubchik, Samir Khuller, Y...
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 7 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
COOPIS
2004
IEEE
13 years 11 months ago
A Distributed and Parallel Component Architecture for Stream-Oriented Applications
Abstract. This paper introduces ThreadMill - a distributed and parallel component architecture for applications that process large volumes of streamed (time-sequenced) data, such a...
Paulo Barthelmess, Clarence A. Ellis
SDM
2003
SIAM
110views Data Mining» more  SDM 2003»
13 years 9 months ago
Mixture Models and Frequent Sets: Combining Global and Local Methods for 0-1 Data
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
Jaakko Hollmén, Jouni K. Seppänen, Hei...
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 23 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang