Constraint solving over OCR graphs

DOI10.1007/3-540-36524-9_17MaRDI QIDQ4420278zbMATH OpenFDO

Authors Andreas Fordan

Publication date 17 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2543/25430205.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Constraint programming techniques for solving problems on graphs
• A variation of the minimum spanning tree problem for the application to mathematical OCR
• Reasoning with graph constraints
• Principles and Practice of Constraint Programming – CP 2004
• Integration of graph constraints into graph grammars
• Constraint satisfaction algorithms for graph pattern matching
• Solving disjunctive constraints for interactive graphical applications
• Graph approach to solving problems of combinatorial recognition
• Constraint Programming Models for Graceful Graphs

Cited in

(1)

• smartFIX: A requirements-driven system for document analysis and understanding

This page was built for publication: Constraint solving over OCR graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420278)