Sciweavers

37 search results - page 5 / 8
» A Coloring Solution to the Edge Crossing Problem
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
BICOB
2009
Springer
14 years 1 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
ISBRA
2009
Springer
14 years 1 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 7 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...
ICPR
2008
IEEE
14 years 8 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof