Sciweavers

23 search results - page 2 / 5
» Computing an Optimal Layout for Cone Trees
Sort
View
ACL
2007
13 years 6 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
MFCS
2000
Springer
13 years 9 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
DAC
1989
ACM
13 years 9 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 6 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
BMCBI
2005
113views more  BMCBI 2005»
13 years 5 months ago
PentaPlot: A software tool for the illustration of genome mosaicism
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
Lutz Hamel, Olga Zhaxybayeva, J. Peter Gogarten