589 search results - page 23 / 118 » Matching Concavity Trees |
DASFAA
2007
IEEE
14 years 4 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
KDD
2002
ACM
14 years 10 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
ICANN
2011
Springer
13 years 1 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
ICDE
2002
IEEE
14 years 11 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
IPL
2006
13 years 9 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...