38 search results - page 1 / 8 » Performance Analysis of Approximate String Searching Impleme... |
ICPPW
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
String comparison is a critical issue in many application domains, including speech recognition, contents search, and bioinformatics. The similarity between two strings of lengths...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Predicting how well applications may run on modern systems is becoming increasingly challenging. It is no longer sufficient to look at number of floating point operations and commu...