Sciweavers

906 search results - page 13 / 182
» Matching Subsequences in Trees
Sort
View
PR
2007
134views more  PR 2007»
13 years 7 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
FPL
2005
Springer
113views Hardware» more  FPL 2005»
14 years 1 months ago
A Reconfigurable Perfect-Hashing Scheme for Packet Inspection
In this paper, we consider scanning and analyzing packets in order to detect hazardous contents using pattern matching. We introduce a hardware perfect-hashing technique to access...
Ioannis Sourdis, Dionisios N. Pnevmatikatos, Steph...
COLING
1996
13 years 9 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
ICIP
2002
IEEE
14 years 9 months ago
Fingerprint matching based on error propagation
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
Ying Hao, Tieniu Tan, Yunhong Wang
ICCV
1999
IEEE
14 years 9 months ago
Approximate Tree Matching and Shape Similarity
Tyng-Luh Liu, Davi Geiger