256 search results - page 20 / 52 » A practical comparison of two K-Means clustering algorithms |
127
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
CLUSTER
2008
IEEE
15 years 6 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
106
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
107
click to vote
ECCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper, we describe an unsupervised learning framework to segment a scene into semantic regions and to build semantic scene models from longterm observations of mo...
99
Voted
ICIP
2001
IEEE
16 years 1 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...