1862 search results - page 88 / 373 » Constrained pattern matching |
88
Voted
CPM
2007
Springer
15 years 7 months ago
2007
Springer
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 ...
112
click to vote
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
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 ...
105
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
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...
109
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...
115
Voted
IFIPTCS
2000
15 years 4 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...