906 search results - page 29 / 182 » Matching Subsequences in Trees |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising i...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
Many different types of silicon fingerprint sweep sensors presently enter the biometrics market. Since they provide small stripe image sequences instead of full fingerprint images...
ENTCS
2007
13 years 7 months ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
DASFAA
2007
IEEE
14 years 2 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 8 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 ...