355 search results - page 39 / 71 » On Central Spanning Trees of a Graph |
159
click to vote
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
166
click to vote
CVPR
2007
IEEE
16 years 8 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...
148
click to vote
AAAI
2007
15 years 8 months ago
2007
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
150
click to vote
HYBRID
2009
Springer
16 years 26 days 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 ...
171
click to vote
NIPS
2004
15 years 7 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...