메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1459-1463

ICDAR 2011 - French handwriting recognition competition

Author keywords

French Handwriting Competition

Indexed keywords

CLASSIFICATION AND RECOGNITION; HANDWRITING RECOGNITION; SUBTASKS; WRITTEN DOCUMENTS;

EID: 82355192036     PISSN: 15205363     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDAR.2011.290     Document Type: Conference Paper
Times cited : (105)

References (9)
  • 2
    • 38149133882 scopus 로고    scopus 로고
    • OpenFst: A general and efficient weighted finite-state transducer library
    • Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), Springer
    • C. Allauzen, M. Riley, J. Schalkwyk, W. Skut, and M. Mohri. OpenFst: A general and efficient weighted finite-state trans- ducer library. In Ninth International Conference on Implementation and Application of Automata, (CIAA 2007), volume 4783 of Lecture Notes in Computer Science, pages 11-23. Springer, 2007. http://www.openfst.org.
    • (2007) Lecture Notes in Computer Science , vol.4783 , pp. 11-23
    • Allauzen, C.1    Riley, M.2    Schalkwyk, J.3    Skut, W.4    Mohri, M.5
  • 5
    • 33749259827 scopus 로고    scopus 로고
    • Connectionist temporal classification: Labelling unsegmented sequence data with recurrent neural networks
    • A. Graves, F. J. Gomez, and J. Schmidhuber. Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks. In International Conference on Machine Learning, pages 369-376, 2006.
    • (2006) International Conference on Machine Learning , pp. 369-376
    • Graves, A.1    Gomez, F.J.2    Schmidhuber, J.3


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