Sciweavers

134 search results - page 4 / 27
» A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 5 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
CPM
1999
Springer
93views Combinatorics» more  CPM 1999»
14 years 2 months ago
Pattern Matching in Text Compressed by Using Antidictionaries
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, ...
DCC
2004
IEEE
14 years 2 months ago
LZW Based Compressed Pattern Matching
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
Tao Tao, Amar Mukherjee
ICIP
2010
IEEE
13 years 8 months ago
High quality scanned book compression using pattern matching
This paper proposes a hybrid approximate pattern matching/ transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorit...
Alexandre Zaghetto, Ricardo L. de Queiroz
SPIRE
1998
Springer
14 years 2 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...