354 search results - page 29 / 71 » Approximate String Joins |
IRAL
2003
ACM
14 years 29 days ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
ICCSA
2010
Springer
14 years 2 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Rule-based email filters mainly rely on the occurrence of critical words to classify spam messages. However, perceptive obfuscation techniques can be used to elude exact pattern ma...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...