654 search results - page 21 / 131 » On the Approximation of Computing Evolutionary Trees |
120
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
114
click to vote
MIAR
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
113
click to vote
IANDC
2011
14 years 4 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
76
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
119
click to vote
INFOCOM
2012
IEEE
13 years 4 days ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...