906 search results - page 1 / 182 » Matching Subsequences in Trees |
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
IDEAS
2007
IEEE
13 years 11 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
IJCV
2008
13 years 4 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
AAAI
1997
13 years 6 months ago
1997
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
EMNLP
2008
13 years 6 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...