Sciweavers

160 search results - page 9 / 32
» Improved Single and Multiple Approximate String Matching
Sort
View
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 5 days 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...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 11 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
LATIN
1998
Springer
13 years 11 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
ICDAR
1999
IEEE
13 years 11 months ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 10 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna