Sciweavers

104 search results - page 9 / 21
» Compression of Unicode Files
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Bit Recycling with Prefix Codes
Many data compression methods cannot remove all redundancy from a file that they compress because it can be encoded to many compressed files. In particular, we consider the redund...
Danny Dubé, Vincent Beaudoin
SSWMC
2004
13 years 8 months ago
Lossless data embedding with file size preservation
In lossless watermarking, it is possible to completely remove the embedding distortion from the watermarked image and recover an exact copy of the original unwatermarked image. Lo...
Jessica J. Fridrich, Miroslav Goljan, Qing Chen, V...
WISE
2009
Springer
14 years 4 months ago
Entry Pairing in Inverted File
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
Hoang Thanh Lam, Raffaele Perego, Nguyen Thoi Minh...
SIGMOD
2003
ACM
1527views Database» more  SIGMOD 2003»
14 years 7 months ago
XPRESS: A Queriable Compression for XML Data
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
Jun-Ki Min, Myung-Jae Park, Chin-Wan Chung
DCC
1998
IEEE
13 years 11 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson