558 search results - page 42 / 112 » Trees and Matchings |
PODS
2008
ACM
15 years 12 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we propose a generative statistical approach for the three dimensional (3D) extraction of the branching structure of unfoliaged deciduous trees from urban image seque...
130
click to vote
PDCAT
2005
Springer
15 years 5 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 ...
107
click to vote
COMPGEOM
2000
ACM
15 years 4 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...
124
click to vote
NJC
2006
14 years 11 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 ...