메뉴 건너뛰기




Volumn , Issue , 2005, Pages 42-46

Steepest descent as message passing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FEEDFORWARD NEURAL NETWORKS; GRAPH THEORY; KALMAN FILTERING; MATHEMATICAL MODELS; STATE SPACE METHODS;

EID: 33749047506     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2005.1531853     Document Type: Conference Paper
Times cited : (10)

References (14)
  • 2
    • 85032780651 scopus 로고    scopus 로고
    • An introduction to factor graphs
    • Jan.
    • H.-A. Loeliger, "An introduction to factor graphs," IEEE Signal Proc. Mag., Jan. 2004, pp. 28-41.
    • (2004) IEEE Signal Proc. Mag. , pp. 28-41
    • Loeliger, H.-A.1
  • 10
    • 0001593436 scopus 로고
    • Recursive parameter estimation using incomplete data
    • D. M. Titterington, "Recursive parameter estimation using incomplete data," R. Roy. Stat. Soc., vol. 46(B), pp. 256-267, 1984.
    • (1984) R. Roy. Stat. Soc. , vol.46 , Issue.B , pp. 256-267
    • Titterington, D.M.1
  • 13
    • 0028996440 scopus 로고
    • Recursive estimate-maximize (EM) algorithms for time varying parameters with applications to multiple target tracking
    • 9-12 May
    • L. Frenkel and M. Feder, "Recursive estimate-maximize (EM) algorithms for time varying parameters with applications to multiple target tracking," IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, 9-12 May, 1995, pp. 2068-2071.
    • (1995) IEEE International Conference on Acoustics, Speech, and Signal Processing , vol.3 , pp. 2068-2071
    • Frenkel, L.1    Feder, M.2


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