Computation of a Unified Graph-Based Rate Optimization Problem

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph entropy, rate-distortion functions and capacity-cost functions with side information. Compared with th...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 73; číslo 11; s. 10976 - 10988
Hlavní autori:	Yuan, Deheng, Guo, Tao, Huang, Zhongyi, Jin, Shi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms alternating optimization algorithm Bipartite graph capacity-cost with side information Computational efficiency Computing time Cost function Data mining Distortion Entropy graph characterization Minimization Optimization Random variables Rate-distortion Rate-distortion for lossy computing Training
ISSN:	0090-6778, 1558-0857
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!