735 search results - page 1 / 147 » Randomization in Parallel Stringology |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
STRINGOLOGY
2004
13 years 6 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
CPM
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Both compressed sensing (CS) and parallel imaging effectively reconstruct magnetic resonance images from undersampled data. Combining both methods enables imaging with greater und...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we propose a new methodology for detecting lane markers that exploits the parallel nature of lane boundaries on the road. First, the input image is pre-processed an...