616 search results - page 52 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
SSPR
2004
Springer
14 years 1 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
SARA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...