847 search results - page 21 / 170 » Approximation algorithms for projective clustering |
183
Voted
ICDT
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
FOCM
2007
14 years 11 months ago
2007
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theo...
103
click to vote
KES
2005
Springer
15 years 4 months ago
2005
Springer
A Decentralised Adaptive Clustering (DAC) algorithm for self-monitoring impact sensing networks is presented within the context of CSIRO-NASA Ageless Aerospace Vehicle project. DAC...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...