112 search results - page 9 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
93
Voted
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
193
click to vote
SIGMOD
2008
ACM
15 years 11 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...
106
Voted
ICDAR
2011
IEEE
13 years 11 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
AIRS
2004
Springer
15 years 5 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
104
click to vote
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...