✦ LIBER ✦

Optimization of linear multiresolution transforms for scene adaptive coding

✍ Scribed by Macq, B.; Mertes, J.Y.

Book ID: 119789661
Publisher: IEEE
Year: 1993
Tongue: English
Weight: 512 KB
Volume: 41
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.258099

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal decoding of linear codes for min

Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

✍ Bahl, L.; Cocke, J.; Jelinek, F.; Raviv, J. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 589 KB

Systematic construction of optimal linea

Systematic construction of optimal linear recurrent codes for burst error correction

✍ Franco P. Preparata 📂 Article 📅 1964 🏛 Springer Milan 🌐 English ⚖ 313 KB

Adaptive cosine transform coding for com

Adaptive cosine transform coding for compression of Mars-96 ELISMA instrument data

✍ Wei-Wei Lu; M.P. Gough 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 497 KB

A self-adaptive linear evolutionary algo

A self-adaptive linear evolutionary algorithm for solving constrained optimization problems

✍ Kezong Tang; Jingyu Yang; Shang Gao; Tingkai Sun 📂 Article 📅 2010 🏛 South China University of Technology and Academy o 🌐 English ⚖ 275 KB

An Adaptive, Rate-Optimal Test of Linear

An Adaptive, Rate-Optimal Test of Linearity for Median Regression Models

✍ Joel L. Horowitz and Vladimir G. Spokoiny 📂 Article 📅 2002 🏛 American Statistical Association 🌐 English ⚖ 514 KB

On Asymptotically Optimal Methods of Pre

On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources

✍ Boris Ya. Ryabko; Flemming Topsøe 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 143 KB

The problem of predicting a sequence x 1 , x 2 , ... generated by a discrete source with unknown statistics is considered. Each letter x t+1 is predicted using information on the word x 1 x 2 • • • x t only. In fact, this problem is a classical problem which has received much attention. Its history