Sciweavers

1477 search results - page 69 / 296
» Pattern Matching with Swaps
Sort
View
ICIP
2002
IEEE
14 years 11 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
KAIS
2006
111views more  KAIS 2006»
13 years 9 months ago
Efficient string matching with wildcards and length constraints
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. A...
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
14 years 3 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
IPPS
2010
IEEE
13 years 7 months ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang
ICALP
2005
Springer
14 years 3 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...