906 search results - page 18 / 182 » Matching Subsequences in Trees |
NIPS
2001
13 years 9 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
SOFSEM
2004
Springer
14 years 1 months ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
IWCIA
2004
Springer
14 years 1 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...