589 search results - page 41 / 118 » Matching Concavity Trees |
164
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
IFSA
2007
Springer
15 years 3 months ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
PODS
2007
ACM
15 years 10 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...
PAMI
2006
14 years 9 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...