1545 search results - page 141 / 309 » On tree congestion of graphs |
CVPR
2007
IEEE
16 years 3 days 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...
SIAMDM
2008
14 years 10 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
TON
2012
13 years 16 days ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
90
Voted
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manually placing landmarks in the ima...