Sciweavers

256 search results - page 4 / 52
» Short trees in polygons
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 10 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
ICPR
2004
IEEE
14 years 9 months ago
Pose Clustering Guided by Short Interpretation Trees
It is common in object recognition algorithms based on viewpoint consistency to find object poses that align many of the object features with features extracted from a search imag...
Clark F. Olson
ESA
2009
Springer
77views Algorithms» more  ESA 2009»
14 years 3 months ago
Short Labels for Lowest Common Ancestors in Trees
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
Johannes Fischer
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 10 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
IACR
2011
104views more  IACR 2011»
12 years 8 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia