Sciweavers

2930 search results - page 88 / 586
» The optimal sequence compression
Sort
View
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 2 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
MP
2010
162views more  MP 2010»
14 years 8 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
VCIP
2001
110views Communications» more  VCIP 2001»
14 years 11 months ago
Lossless and near-lossless image compression with successive refinement
We present a technique that provides progressive transmission and near-lossless compression in one single framework. The proposed technique produces a bitstream that results in pr...
Ismail Avcibas, Nasir D. Memon, Bülent Sankur...
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 5 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
TIT
1998
216views more  TIT 1998»
14 years 9 months ago
Data Compression and Harmonic Analysis
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
David L. Donoho, Martin Vetterli, Ronald A. DeVore...