Sciweavers

108 search results - page 8 / 22
» Fast Convolutions and Their Applications in Approximate Stri...
Sort
View
JSAC
2006
163views more  JSAC 2006»
13 years 7 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
CIKM
2001
Springer
14 years 2 days ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...
ACIVS
2008
Springer
14 years 1 months ago
Blur and Contrast Invariant Fast Stereo Matching
We propose a novel approach for estimating a depth-map from a pair of rectified stereo images degraded by blur and contrast change. At each location in image space, information is...
Matteo Pedone, Janne Heikkilä
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 1 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 11 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi