906 search results - page 66 / 182 » Matching Subsequences in Trees |
PDCAT
2005
Springer
14 years 2 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
COMPGEOM
2000
ACM
14 years 1 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
NJC
2006
13 years 9 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
ISAAC
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
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...