메뉴 건너뛰기




Volumn 50, Issue 5, 2002, Pages 1124-1132

Complexity reduction in fixed-lag smoothing for hidden Markov models

Author keywords

Hidden markov model; Nearly completely decomposable; Reduced complexity; Slow fast decomposition; State aggregation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; VECTORS;

EID: 0036571057     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.995068     Document Type: Article
Times cited : (5)

References (23)
  • 1
    • 0024610919 scopus 로고
    • A tutorial on hidden Markov models and selected applications in speech recognition
    • Feb.
    • (1989) Proc. IEEE , vol.77 , pp. 257-285
    • Rabiner, L.R.1
  • 9
    • 0024680811 scopus 로고
    • Stochastic complementation, uncoupled Markov chains and the theory of nearly reducible systems
    • June
    • (1989) SIAM Rev. , vol.31 , pp. 240-272
    • Meyer, C.D.1


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