256 search results - page 31 / 52 » Short trees in polygons |
108
click to vote
ICCAD
2008
IEEE
15 years 10 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...
133
Voted
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
ALMOB
2008
15 years 2 months ago
2008
Background: Sequence-based phylogeny reconstruction is a fundamental task in Bioinformatics. Practically all methods for phylogeny reconstruction are based on multiple alignments....
115
click to vote
IGARSS
2009
14 years 11 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...
105
click to vote
ICLP
1992
Springer
15 years 6 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...