169 search results - page 5 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
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...
CPM
1999
Springer
13 years 11 months ago
1999
Springer
VLDB
1993
ACM
13 years 11 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
STACS
2009
Springer
14 years 2 months ago
2009
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...