257 search results - page 16 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
192
click to vote
SDM
2011
SIAM
14 years 13 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
181
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...
103
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...