Sciweavers

564 search results - page 19 / 113
» Error-tolerant Tree Matching
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 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...
CISSE
2007
Springer
14 years 1 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
14 years 9 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
14 years 2 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
INFOCOM
2010
IEEE
13 years 5 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna