Sciweavers

354 search results - page 14 / 71
» Approximate String Joins
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
13 years 21 days ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
AAAI
2010
13 years 10 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan
PR
1998
86views more  PR 1998»
13 years 8 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
ICPPW
2003
IEEE
14 years 2 months ago
Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform
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...
Panagiotis D. Michailidis, Konstantinos G. Margari...