910 search results - page 26 / 182 » Detecting False Matches in String Matching Algorithms |
125
click to vote
IPL
2007
15 years 2 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
160
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
i In this paper, we identify the unique challenges in deploying parallelism on TCAM-based pattern matching for Network Intrusion Detection Systems (NIDSes). We resolve two critica...
131
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
147
click to vote
JCIT
2010
14 years 9 months ago
2010
With the development of high-speed network technique and increasing volume of network traffic, traditional pattern matching method can't adapt to the new challenges to intrus...
132
click to vote
APIN
2000
15 years 2 months ago
2000
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...