1217 search results - page 72 / 244 » On compressing frequent patterns |
171
click to vote
ICIP
1999
IEEE
16 years 5 months ago
1999
IEEE
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...
134
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
116
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
144
click to vote
STACS
2009
Springer
15 years 10 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...
132
click to vote
ICAPR
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we analyse the effects that JPEG and JPEG2000 compression have on subspace appearance-based face recognition algorithms. This is the first comprehensive study of stan...