A "follow the perturbed leader"-type algorithm for zero-delay quantization of individual sequences
暂无分享,去创建一个
[1] Tamás Linder,et al. Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding , 2004, IEEE Transactions on Signal Processing.
[2] S. Vempala,et al. Eecient Algorithms for Online Decision Problems , 2003 .
[3] N. Merhav,et al. On limited-delay lossy coding and filtering of individual sequences , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[4] Tamás Linder,et al. Efficient algorithms and minimax bounds for zero-delay lossy source coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[5] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[6] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[8] Kaizhong Zhang,et al. Quantizer monotonicities and globally optimal scalar quantizer design , 1993, IEEE Trans. Inf. Theory.
[9] Tamás Linder,et al. A zero-delay sequential scheme for lossy coding of individual sequences , 2001, IEEE Trans. Inf. Theory.