Sciweavers

564 search results - page 17 / 113
» Error-tolerant Tree Matching
Sort
View
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 7 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
ACCV
1998
Springer
13 years 11 months ago
Learning Multiscale Image Models of 2D Object Classes
This paper isconcerned with learning the canonical gray scalestructure of the images of a classof objects. Structure is defined in terms of the geometry and layout of salientimage...
Benoit Perrin, Narendra Ahuja, Narayan Srinivasa
ENTCS
2007
121views more  ENTCS 2007»
13 years 7 months ago
An Account of Implementing Applicative Term Rewriting
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
Muck van Weerdenburg
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
14 years 1 months ago
TwigList : Make Twig Pattern Matching Fast
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...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 7 months ago
Efficiently mining frequent trees in a forest
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 ...
Mohammed Javeed Zaki