Sciweavers

514 search results - page 30 / 103
» Approximate Periods of Strings
Sort
View
STACS
1992
Springer
13 years 12 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
14 years 1 months ago
A systolic array technique for determining common approximate substrings
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
Kenneth B. Kent, Jacqueline E. Rice
ICDAR
2003
IEEE
14 years 1 months ago
String Extraction From Color Airline Coupon Image Using Statistical Approach
A novel technique is presented in this paper to extract strings in color images of both Business Settlement Plan (BSP) and non-BSP airline coupon. The essential concept is to remo...
Yi Li, Zhiyan Wang, Haizan Zeng
FOCS
2004
IEEE
13 years 11 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...