2487 search results - page 244 / 498 » Partitions of Graphs into Trees |
127
click to vote
BILDMED
2008
15 years 5 months ago
2008
Abstract. Validation of non-rigid registration methods is still a challenging task. Different evaluation criteria were published, yet no widely accepted gold standard exists. The a...
139
Voted
WOB
2004
15 years 5 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
106
Voted
COMBINATORICS
2007
15 years 4 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
127
click to vote
ICCAD
2008
IEEE
16 years 26 days ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
143
Voted
ICIP
2001
IEEE
16 years 5 months ago
2001
IEEE
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...