On the refinement of the binary symmetric markov source

Luis Lastras; Toby Berger

doi:10.1109/ISIT.2001.936058

IEEE International Symposium on Information Theory - Proceedings

Paper

01 Jan 2001

On the refinement of the binary symmetric markov source

View publication

Abstract

The BSMSn source is addressed in this study. It is shown that BSMSn is not successively refinable under the Hamming distortion measure, provided that n > 2.

Paper

Parallel program schemata

Richard M. Karp, Raymond E. Miller

Journal of Computer and System Sciences

Paper

The quantization of a classically ergodic system

Martin C. Gutzwiller

Physica D: Nonlinear Phenomena

Talk

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Trang H. Tran, Lam Nguyen, et al.

INFORMS 2022

Paper

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

View all publications

Abstract

Related

Parallel program schemata

The quantization of a classically ergodic system

Nesterov Accelerated Shuffling Gradient Method for Convex Optimization

Multiparameter parallel search branch switching