Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
From MaRDI portal
Publication:5354133
DOI10.1109/TSP.2004.831128zbMath1369.94443MaRDI QIDQ5354133
András György, Tamás Linder, Gábor Lugosi
Publication date: 8 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Source coding (94A29)
Related Items (4)
Randomized prediction of individual sequences ⋮ Adaptive reference levels in a level-crossing analog-to-digital converter ⋮ A \((\star, \ast)\)-based Minkowski's inequality for Sugeno fractional integral of order \(\alpha > 0\) ⋮ Sensor networks: from dependence analysis via matroid bases to online synthesis
This page was built for publication: Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding