Sciweavers

910 search results - page 15 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
96
Voted
EMNLP
2009
14 years 9 months ago
Real-Word Spelling Correction using Google Web 1T 3-grams
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
Aminul Islam, Diana Inkpen
FCCM
2004
IEEE
163views VLSI» more  FCCM 2004»
15 years 3 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...
IMC
2006
ACM
15 years 5 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
15 years 6 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski
MAM
2008
150views more  MAM 2008»
14 years 11 months ago
FPGA based string matching for network processing applications
String matching is a key problem in many network processing applications. Current implementations of this process using software are time consuming and cannot meet gigabit bandwid...
Janardhan Singaraju, John A. Chandy