118 search results - page 9 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
81
Voted
KAIS
2006
14 years 9 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
ESA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
ICIP
2001
IEEE
15 years 11 months ago
2001
IEEE
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...