35 search results - page 3 / 7 » LZW Based Compressed Pattern Matching |
ICDAR
2003
IEEE
13 years 11 months ago
2003
IEEE
Our aim is to achieve writer identification process thanks to a fractal analysis of handwriting style. For each writer, a set of characteristics is extracted. They are specific to...
CSB
2002
IEEE
13 years 11 months ago
2002
IEEE
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
SIGIR
1998
ACM
13 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
CISS
2011
IEEE
12 years 10 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...