메뉴 건너뛰기




Volumn , Issue , 2016, Pages

Neural random-access machines

Author keywords

[No Author keywords available]

Indexed keywords

BACKPROPAGATION ALGORITHMS; BINARY TREES; MEMORY ARCHITECTURE; NETWORK ARCHITECTURE; TREES (MATHEMATICS);

EID: 85083953578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (62)

References (20)
  • 2
    • 0028392483 scopus 로고
    • Learning long-term dependencies with gradient descent is difficult
    • Bengio, Yoshua, Simard, Patrice, and Frasconi, Paolo. Learning long-term dependencies with gradient descent is difficult. Neural Networks, IEEE Transactions on, 5(2):157–166, 1994.
    • (1994) Neural Networks, IEEE Transactions on , vol.5 , Issue.2 , pp. 157-166
    • Bengio, Y.1    Simard, P.2    Frasconi, P.3
  • 14
    • 4544279425 scopus 로고
    • A formal theory of inductive inference. Part I
    • Solomonoff, Ray J. A formal theory of inductive inference. part i. Information and control, 7(1): 1–22, 1964.
    • (1964) Information and Control , vol.7 , Issue.1 , pp. 1-22
    • Solomonoff, R.J.1


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