Sciweavers

15 search results - page 1 / 3
» Improving Bayesian Spam Filters Using String Edit Distance A...
Sort
View
91
Voted
IC
2008
15 years 4 months ago
Improving Bayesian Spam Filters Using String Edit Distance Algorithm
Farhana Aleen, Kuha Mahalingam
IPPS
2002
IEEE
15 years 8 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
STACS
2009
Springer
15 years 10 months ago
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
151
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...