257 search results - page 8 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
86
Voted
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
113
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
MM
2010
ACM
14 years 12 months ago
2010
ACM
The Internet brings us access to multimedia databases with billions of data instances. The massive amount of data available to researchers and application developers brings both o...
93
Voted
WIS
2004
15 years 1 months ago
2004
The sensor networks, web click stream and astronomical applications generate a continuous flow of data streams. Most likely data streams are generated in a wireless environment. Th...