Sciweavers

257 search results - page 2 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
12 years 8 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
GRAPHICSINTERFACE
2003
13 years 6 months ago
A Stream Algorithm for the Decimation of Massive Meshes
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
Jianhua Wu, Leif Kobbelt
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 8 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
VLDB
2002
ACM
137views Database» more  VLDB 2002»
13 years 5 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...