1028 search results - page 40 / 206 » Character sets of strings |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational setti...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
PRL
2002
13 years 7 months ago
2002
This paper presents a learning system that uses genetic programming as a tool for automatically inferring the set of classification rules to be used during a preclassification sta...