Sciweavers

1525 search results - page 12 / 305
» Matching with Regular Constraints
Sort
View
INFOCOM
2011
IEEE
14 years 3 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 11 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
SPIRE
2010
Springer
14 years 10 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
RAID
2009
Springer
15 years 6 months ago
Multi-byte Regular Expression Matching with Speculation
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs...
Daniel Luchaup, Randy Smith, Cristian Estan, Somes...
MICCAI
2006
Springer
16 years 19 days ago
Automatic Point Landmark Matching for Regularizing Nonlinear Intensity Registration: Application to Thoracic CT Images
Nonlinear image registration is a prerequisite for a variety of medical image analysis tasks. A frequently used registration method is based on manually or automatically derived po...
Martin Urschler, Christopher Zach, Hendrik Ditt, H...