메뉴 건너뛰기




Volumn , Issue , 2004, Pages 342-351

A "follow the perturbed leader"-type algorithm for zero-delay quantization of individual sequences

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 2642551766     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (9)
  • 1
    • 0035441867 scopus 로고    scopus 로고
    • A zero-delay sequential scheme for lossy coding of individual sequences
    • Sep.
    • T. Linder and G. Lugosi, "A zero-delay sequential scheme for lossy coding of individual sequences," IEEE Trans. Inform. Theory, vol. 47, pp. 2533-2538, Sep. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2533-2538
    • Linder, T.1    Lugosi, G.2
  • 3
    • 0032047115 scopus 로고    scopus 로고
    • A game of prediction with expert advice
    • V. Vovk, "A game of prediction with expert advice," Journal of Computer and System Sciences, vol. 56, pp. 153-173, 1998.
    • (1998) Journal of Computer and System Sciences , vol.56 , pp. 153-173
    • Vovk, V.1
  • 5
    • 0036496258 scopus 로고    scopus 로고
    • On limited-delay lossy coding and filtering of individual sequences
    • Mar.
    • T. Weissman and N. Merhav, "On limited-delay lossy coding and filtering of individual sequences," IEEE Trans. Inform. Theory, vol. 48, pp. 721-733, Mar. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 721-733
    • Weissman, T.1    Merhav, N.2
  • 6
    • 24244469714 scopus 로고    scopus 로고
    • Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding
    • submitted to
    • A. György, T. Linder, and G. Lugosi, "Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding," submitted to IEEE Transactions on Signal Processing, 2003. available at www.szit.bme.hu/~gya/publications/GyLiLu03.ps.
    • (2003) IEEE Transactions on Signal Processing
    • György, A.1    Linder, T.2    Lugosi, G.3
  • 7
    • 10444233821 scopus 로고    scopus 로고
    • Efficient algorithms for the online decision problem
    • Washington, D. C., USA
    • A. Kalai and S. Vempala, "Efficient algorithms for the online decision problem," in Proc. 16th Conf. on Computational Learning Theory, (Washington, D. C., USA), 2003. available at http://www-math.mit.edu/~vempala/ papers/online.ps.
    • (2003) Proc. 16th Conf. on Computational Learning Theory
    • Kalai, A.1    Vempala, S.2
  • 8
    • 0001976283 scopus 로고
    • Approximation to Bayes risk in repeated plays
    • (M. Dresher, A. Tucker, and P. Wolfe, eds.), Princeton University Press
    • J. Hannan, "Approximation to Bayes risk in repeated plays," in Contributions to the Theory of Games (M. Dresher, A. Tucker, and P. Wolfe, eds.), vol. 3, pp. 97-139, Princeton University Press, 1957.
    • (1957) Contributions to the Theory of Games , vol.3 , pp. 97-139
    • Hannan, J.1
  • 9
    • 0027597078 scopus 로고
    • Quantizer monotonicities and globally optimal scalar quantizer design
    • X. Wu and K. Zhang, "Quantizer monotonicities and globally optimal scalar quantizer design," IEEE Trans. Inform. Theory, vol. 39, pp. 1049-1053, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1049-1053
    • Wu, X.1    Zhang, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.