10493 search results - page 3 / 2099 » Dynamic Word Problems |
AIML
2004
13 years 8 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
INFORMATICALT
2002
13 years 6 months ago
2002
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
TCS
1998
13 years 6 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
ICDAR
2007
IEEE
14 years 1 months ago
2007
IEEE
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistenci...