583 search results - page 5 / 117 » New algorithms for efficient parallel string comparison |
82
Voted
NIPS
2008
14 years 11 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
IJWET
2008
14 years 9 months ago
2008
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
94
Voted
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
89
Voted
ALGORITHMICA
2005
14 years 9 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...