616 search results - page 21 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
ISITA
2010
13 years 5 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
ISPDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...