메뉴 건너뛰기




Volumn 2543, Issue , 2003, Pages 205-216

Constraint solving over OCR graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; ERROR ANALYSIS; FUZZY CONTROL; GRAPH THEORY; MATHEMATICAL MODELS; DECISION SUPPORT SYSTEMS; KNOWLEDGE MANAGEMENT;

EID: 23144437202     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-36524-9_17     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 2
    • 0003129454 scopus 로고
    • From paper to office document standard representation
    • A. Dengel, R. Bleisinger, R. Hoch, F. Fein, and F. Hönes. From paper to office document standard representation. IEEE Computer, 25(7):63-67, 1992.
    • (1992) IEEE Computer , vol.25 , Issue.7 , pp. 63-67
    • Dengel, A.1    Bleisinger, R.2    Hoch, R.3    Fein, F.4    Hönes, F.5
  • 5
    • 84950152463 scopus 로고    scopus 로고
    • Insiders information management GmbH, Kaiserslautern
    • Insiders Information Management GmbH, Kaiserslautern. smartFIX 2.0 User Manual, 2001.
    • (2001) SmartFIX 2.0 User Manual
  • 7
    • 4243532938 scopus 로고
    • Constraint logic programming: A survey
    • July
    • J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19/20:339-395, July 1994.
    • (1994) Journal of Logic Programming , vol.19 , Issue.20 , pp. 339-395
    • Jaffar, J.1    Maher, M.J.2
  • 8
    • 0020751568 scopus 로고
    • The noisy substring matching problem
    • R. L. Kashyap and B. J. Oommen. The noisy substring matching problem. In IEEE, 1983.
    • (1983) IEEE
    • Kashyap, R.L.1    Oommen, B.J.2
  • 13
    • 0025516947 scopus 로고
    • Optimal correspondence of string subsequences
    • Ynjin P. Wang and Theo Pavlidis. Optimal correspondence of string subsequences. In IEEE, 1990.
    • (1990) IEEE
    • Wang, Y.P.1    Pavlidis, T.2


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