메뉴 건너뛰기




Volumn , Issue , 1998, Pages 479-485

A revolution: Belief propagation in graphs with cycles

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; PROBABILITY;

EID: 84898964205     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (244)

References (11)
  • 1
    • 0030257652 scopus 로고    scopus 로고
    • Near optimum error correcting coding and decoding: Turbo-codes
    • C. Berrou and A. Glavieux 1996. Near optimum error correcting coding and decoding: Turbo-codes. IEEE Transactions on Communications 44, 1261-1271.
    • (1996) IEEE Transactions on Communications , vol.44 , pp. 1261-1271
    • Berrou, C.1    Glavieux, A.2
  • 2
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using Bayesian belief networks
    • G. F. Cooper 1990. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42, 393-405.
    • (1990) Artificial Intelligence , vol.42 , pp. 393-405
    • Cooper, G.F.1
  • 6
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application to expert systems
    • S. L. Lauritzen and D. J. Spiegelhalter 1988. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society B 50, 157-224.
    • (1988) Journal of the Royal Statistical Society B , vol.50 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.J.2
  • 7
    • 84947903359 scopus 로고
    • Good codes based on very sparse matrices
    • number 1025 in Lecture Notes in Computer Science, Springer, Berlin Germany
    • D. J. C. MacKay and R. M. Neal 1995. Good codes based on very sparse matrices. In Cryptography and Coding. 5th IMA Conference, number 1025 in Lecture Notes in Computer Science, 100-111, Springer, Berlin Germany.
    • (1995) Cryptography and Coding, 5th IMA Conference , pp. 100-111
    • MacKay, D.J.C.1    Neal, R.M.2
  • 8
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • Due to editing errors, reprinted in Electronics Letters 33, 457-458
    • D. J. C. MacKay and R. M. Neal 1996. Near Shannon limit performance of low density parity check codes. Electronics Letters 32, 1645-1646. Due to editing errors, reprinted in Electronics Letters 33, 457-458.
    • (1996) Electronics Letters , vol.32 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 10
    • 84856043672 scopus 로고
    • A mathematical theory of communication
    • 623-656
    • C. E. Shannon 1948. A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656.
    • (1948) Bell System Technical Journal , vol.27 , pp. 379-423
    • Shannon, C.E.1
  • 11
    • 0031568356 scopus 로고    scopus 로고
    • Probabilistic independence networks for hidden Markov probability models
    • P. Smyth, D. Heckerman, and M. I. Jordan 1997. Probabilistic independence networks for hidden Markov probability models. Neural Computation 9, 227-270.
    • (1997) Neural Computation , vol.9 , pp. 227-270
    • Smyth, P.1    Heckerman, D.2    Jordan, M.I.3


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