Sciweavers

7 search results - page 1 / 2
» Bloom Filter Accelerator for String Matching
Sort
View
ICCCN
2007
IEEE
13 years 10 months ago
Bloom Filter Accelerator for String Matching
— In this paper we present a hardware architecture for string matching. Our solution based on using a Bloom filter based pre-processor and a parallelized hashing engine is capab...
M. Nourani, P. Katta
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
13 years 7 months ago
Implementation Results of Bloom Filters for String Matching
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...
Michael Attig, Sarang Dharmapurikar, John W. Lockw...
ISAAC
1994
Springer
91views Algorithms» more  ISAAC 1994»
13 years 7 months ago
A New Problem in String Searching
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
George Havas, Jin Xian Lian
JSAC
2006
163views more  JSAC 2006»
13 years 3 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
ICWS
2009
IEEE
13 years 1 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang