메뉴 건너뛰기




Volumn 2375, Issue , 2002, Pages 380-395

Prediction and dimension

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

EID: 84937416143     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_26     Document Type: Conference Paper
Times cited : (4)

References (25)
  • 3
    • 0033234631 scopus 로고    scopus 로고
    • On prediction of individual sequences
    • N. Cesa-Bianchi and G. Lugosi. On prediction of individual sequences. Annals of Statistics, 27(6):1865-1895, 1999.
    • (1999) Annals of Statistics , vol.27 , Issue.6 , pp. 1865-1895
    • Cesa-Bianchi, N.1    Lugosi, G.2
  • 9
    • 34250950477 scopus 로고
    • Dimension und äusseres Mass
    • F. Hausdorff. Dimension und äusseres Mass. Math. Ann., 79:157-179, 1919.
    • (1919) Math. Ann. , vol.79 , pp. 157-179
    • Hausdorff, F.1
  • 10
    • 0000733254 scopus 로고
    • A newin terpretation of information rate
    • J. Kelly. A newin terpretation of information rate. Bell Systems Technical Journal, 35:917-926, 1956.
    • (1956) Bell Systems Technical Journal , vol.35 , pp. 917-926
    • Kelly, J.1
  • 11
    • 0007424433 scopus 로고
    • On tables of random numbers
    • A. N. Kolmogorov. On tables of random numbers. Sankhya¯, Series A, 25:369-376, 1963.
    • (1963) Sankhya¯, Series A , vol.25 , pp. 369-376
    • Kolmogorov, A.N.1
  • 13
    • 0033718506 scopus 로고    scopus 로고
    • Dimension in complexity classes
    • IEEE Computer Society Press, 2000. Updated version appears as Technical report, ACM Computing Research Repository
    • J. H. Lutz. Dimension in complexity classes. In Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158-169. IEEE Computer Society Press, 2000. Updated version appears as Technical report cs.CC/0203016, ACM Computing Research Repository, 2002.
    • (2002) Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity , pp. 158-169
    • Lutz, J.H.1
  • 14
    • 84974575141 scopus 로고    scopus 로고
    • Gales and the constructive dimension of individual sequences
    • Springer-Verlag, 2000. Updated version appears as Technical report, ACM Computing Research Repository
    • J. H. Lutz. Gales and the constructive dimension of individual sequences. In Proceedings of the Twenty-Seventh International Colloquium on Automata, Languages, and Programming, pages 902-913. Springer-Verlag, 2000. Updated version appears as Technical report cs.CC/0203017, ACM Computing Research Repository, 2002.
    • (2002) Proceedings of the Twenty-Seventh International Colloquium on Automata, Languages, and Programming , pp. 902-913
    • Lutz, J.H.1
  • 16
  • 17
    • 0004018518 scopus 로고
    • Algorithmic approach to the prediction problem
    • B. Ya. Ryabko. Algorithmic approach to the prediction problem. Problems of Information Transmission, 29:186-193, 1993.
    • (1993) Problems of Information Transmission , vol.29 , pp. 186-193
    • Ryabko, B.Y.1
  • 18
    • 0000797906 scopus 로고
    • The complexity and effectiveness of prediction problems
    • B. Ya. Ryabko. The complexity and effectiveness of prediction problems. Journal of Complexity, 10:281-295, 1994.
    • (1994) Journal of Complexity , vol.10 , pp. 281-295
    • Ryabko, B.Y.1
  • 19
    • 0000583779 scopus 로고
    • A unified approach to the definition of random sequences
    • C. P. Schnorr. A unified approach to the definition of random sequences. Mathematical Systems Theory, 5:246-258, 1971.
    • (1971) Mathematical Systems Theory , vol.5 , pp. 246-258
    • Schnorr, C.P.1
  • 21
    • 84944486544 scopus 로고
    • Certain results in coding theory for noisy channels
    • C. E. Shannon. Certain results in coding theory for noisy channels. Bell Systems Technical Journal, 30:50-64, 1951.
    • (1951) Bell Systems Technical Journal , vol.30 , pp. 50-64
    • Shannon, C.E.1
  • 22
    • 0002394549 scopus 로고
    • On relations between different algorithmic definitions of randomness
    • A. Kh. Sheń. On relations between different algorithmic definitions of randomness. Soviet Mathematics Doklady, 38:316-319, 1989.
    • (1989) Soviet Mathematics Doklady , vol.38 , pp. 316-319
    • Sheń, A.K.1
  • 23
    • 38249002230 scopus 로고
    • Kolmogorov complexity and Hausdorff dimension
    • L. Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Control, 103:159-94, 1993.
    • (1993) Information and Control , vol.103 , pp. 159-194
    • Staiger, L.1
  • 24
    • 0038856793 scopus 로고    scopus 로고
    • A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
    • L. Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215-29, 1998.
    • (1998) Theory of Computing Systems , vol.31 , pp. 215-229
    • Staiger, L.1


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