178 search results - page 12 / 36 » Fast Algorithms for Top-k Approximate String Matching |
IPL
2007
14 years 9 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...
JSAC
2006
14 years 9 months ago
2006
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....
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
53
Voted
ESA
2004
Springer
15 years 2 months ago
2004
Springer
CIKM
2001
Springer
15 years 2 months ago
2001
Springer
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...