Sciweavers

516 search results - page 25 / 104
» Sets of k-Independent Strings
Sort
View
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 1 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 2 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 9 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
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 9 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
ICPR
2004
IEEE
14 years 8 months ago
A Two-Stage Approach for Segmentation and Recognition of Handwritten Digit Strings Collected from Mail Pieces
In this paper, we present an approach to interpret handwritten digit strings by employing a two-stage segmentation and recognition scheme. The first stage processing is to deal wi...
Gyeonghwan Kim, Seon-Hwa Jeong, Sungwon Park, Yunh...