558 search results - page 37 / 112 » Trees and Matchings |
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
105
click to vote
ICVGIP
2004
15 years 1 months ago
2004
A 3D reconstruction of retinal blood vessel trees using two views of fundus images is presented. The problem addresses: 1) The recovery of camera-eye model parameters by an self-c...
PODS
2007
ACM
15 years 12 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
123
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
110
click to vote
MICCAI
2007
Springer
16 years 22 days ago
2007
Springer
There exists a large body of literature on shape matching and registration in medical image analysis. However, most of the previous work is focused on matching particular sets of f...