Sciweavers

7 search results - page 1 / 2
» Lossless Data Compression via Substring Enumeration
Sort
View
DCC
2010
IEEE
13 years 11 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
ISITA
2010
13 years 2 months ago
Using synchronization bits to boost compression by substring enumeration
A new lossless data compression technique called compression via substring enumeration (CSE) has recently been introduced. It has been observed that CSE achieves lower performance ...
Danny Dubé
CCR
2010
203views more  CCR 2010»
13 years 5 months ago
Minimizing energy consumptions in wireless sensor networks via two-modal transmission
We present a sophisticated framework to systematically explore the temporal correlation in environmental monitoring wireless sensor networks. The presented framework optimizes los...
Yao Liang, Wei Peng
GEM
2008
13 years 6 months ago
Better Huffman Coding via Genetic Algorithm
Abstract--We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowled...
Cody Boisclair, Markus Wagner
TOG
2002
127views more  TOG 2002»
13 years 4 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers