메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1176-1183

Efficiently learning linear-linear exponential family predictive representations of state

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMICAL SYSTEMS; MACHINE LEARNING; MAXIMUM LIKELIHOOD; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; EDUCATION; IMAGE SEGMENTATION; LEARNING SYSTEMS; ROBOT LEARNING;

EID: 56449115195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390304     Document Type: Conference Paper
Times cited : (5)

References (6)
  • 1
    • 33645149161 scopus 로고    scopus 로고
    • Fast low-rank modifications of the thin singular value decomposition
    • Brand, M. (2006). Fast low-rank modifications of the thin singular value decomposition. Linear Algebra and its Applications, 415, 20-30.
    • (2006) Linear Algebra and its Applications , vol.415 , pp. 20-30
    • Brand, M.1
  • 2
    • 0027560587 scopus 로고
    • Approximate probabilistic reasoning in bayesian belief networks is NP-hard
    • Dagum, P., & Luby, M. (1993). Approximate probabilistic reasoning in bayesian belief networks is NP-hard. Artificial Intelligence, 60, 141-153.
    • (1993) Artificial Intelligence , vol.60 , pp. 141-153
    • Dagum, P.1    Luby, M.2


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