Sciweavers

250 search results - page 22 / 50
» Reorganizing compressed text
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
PAMI
2006
141views more  PAMI 2006»
14 years 10 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
ICIP
1999
IEEE
15 years 11 months ago
A Fast Segmentation Algorithm for Bi-Level Image Compression Using JBIG2
The emerging JBIG2 standard allows compliant encoders to achieve very high compression rates on bi-level images, especially when images are properly segmented into regions of line...
Dave A. D. Tompkins, Faouzi Kossentini
DCC
2010
IEEE
15 years 4 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
WOA
2007
14 years 11 months ago
News Retrieval through a MultiAgent System
— The continuous growth of information sources on the web, together with the corresponding volume of dailyupdated contents, makes the problem of finding news and articles a chal...
Andrea Addis, Giuliano Armano, Francesco Mascia, E...