Sciweavers

906 search results - page 31 / 182
» Matching Subsequences in Trees
Sort
View
IPL
2006
103views more  IPL 2006»
14 years 9 months ago
On the cost of searching signature trees
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...
Yangjun Chen
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 3 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
64
Voted
CISSE
2007
Springer
15 years 3 months ago
Biometrics of Cut Tree Faces
An issue of some interest to those in the lumber and timber industry is the rapid matching of a cut log face with its mate. For example, the U.S. Forest Service experiences a consi...
W. A. Barrett
ICIP
2000
IEEE
15 years 11 months ago
Document Image Matching Based on Component Blocks
Document image matching is the key technique for document registration and retrieval. In this paper, a new matching algorithm based on document component block list and component ...
Hanchuan Peng, Fuhui Long, Wan-Chi Siu, Zheru Chi,...
LATA
2009
Springer
15 years 4 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher