231 search results - page 6 / 47 » Sublinear time approximate clustering |
110
Voted
STOC
2004
ACM
16 years 22 days ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
77
Voted
STOC
2002
ACM
16 years 22 days ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
110
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
103
Voted
CIKM
1997
Springer
15 years 4 months ago
1997
Springer
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
110
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...