540 search results - page 3 / 108 » A New Compression Method for Compressed Matching |
CORR
2010
Springer
13 years 7 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...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
In this paper, we propose a compression algorithm focused on the peculiarities of hyperspectral images. The spectral redundancy in hyperspectral images is exploited by using a con...
CISST
2003
13 years 8 months ago
2003
We present a new method to compress triangle meshes in a lossless manner. Triangle compression requires compression of the geometry (vertices) as well as the topology (connectivit...
CPM
1999
Springer
13 years 11 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...