440 search results - page 41 / 88 » Comparison of Galled Trees |
ICCAD
2008
IEEE
15 years 7 months 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...
115
Voted
ICS
2009
Tsinghua U.
15 years 3 months ago
2009
Tsinghua U.
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
90
Voted
CSL
2009
Springer
15 years 2 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
IGARSS
2009
14 years 8 months ago
2009
In this paper, a comparison is made through evaluating the withinand between-class species variability for the original, the first derivative and second derivative spectra. For ea...
BMCBI
2005
14 years 10 months ago
2005
Background: Popular methods to reconstruct molecular phylogenies are based on multiple sequence alignments, in which addition or removal of data may change the resulting tree topo...