Sciweavers

910 search results - page 27 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
IPPS
2008
IEEE
15 years 9 months ago
High-speed string searching against large dictionaries on the Cell/B.E. Processor
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
MJ
2006
138views more  MJ 2006»
15 years 2 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
CCS
2003
ACM
15 years 8 months ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
EOR
2006
74views more  EOR 2006»
15 years 2 months ago
A set theoretic framework for enumerating matches in surveys and its application to reducing inaccuracies in vehicle roadside su
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
Richard G. Clegg
FI
2010
130views more  FI 2010»
15 years 6 days ago
Improving Anomaly Detection for Text-Based Protocols by Exploiting Message Structures
: Service platforms using text-based protocols need to be protected against attacks. Machine-learning algorithms with pattern matching can be used to detect even previously unknown...
Martin Güthle, Jochen Kögel, Stefan Wahl...