13 search results - page 3 / 3 » Intelligent System for Reading Handwriting on Forms |
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
ASSETS
2009
ACM
14 years 4 months ago
2009
ACM
In this paper, we compare alternative techniques for evaluating a software system for simplifying the readability of texts for adults with mild intellectual disabilities (ID). We ...
BMCBI
2011
13 years 1 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...