Sciweavers

2930 search results - page 2 / 586
» The optimal sequence compression
Sort
View
DCC
2005
IEEE
14 years 4 months ago
Lossless Data Compression Using Optimal Tree Machines
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
Gergely Korodi, Jorma Rissanen, Ioan Tabus
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
13 years 11 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
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...
Kimmo Fredriksson, Fedor Nikitin
ICASSP
2011
IEEE
12 years 9 months ago
Additive character sequences with small alphabets for compressed sensing matrices
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
Nam Yul Yu
WISE
2002
Springer
13 years 10 months ago
Cluster-Based Delta Compression of a Collection of Files
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
Zan Ouyang, Nasir D. Memon, Torsten Suel, Dimitre ...
LCTRTS
2005
Springer
13 years 10 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...