Sciweavers

2066 search results - page 145 / 414
» Word Maturity: Computational Modeling of Word Knowledge
Sort
View
ICALP
2004
Springer
15 years 3 months ago
Tree-Walking Automata Cannot Be Determinized
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
Mikolaj Bojanczyk, Thomas Colcombet
ICPR
2002
IEEE
15 years 2 months ago
Progress in Document Reconstruction
We combine information from a language model and character image pattern matching to iteratively reduce ambiguity in document images. Combining word shape information and lists of...
A. Lawrence Spitz
AMC
2007
114views more  AMC 2007»
14 years 10 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
IPL
2007
125views more  IPL 2007»
14 years 10 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
EC
2011
262views ECommerce» more  EC 2011»
14 years 5 months ago
Computer-Automated Evolution of an X-Band Antenna for NASA's Space Technology 5 Mission
Whereas the current practice of designing antennas by hand is severely limited because it is both time and labor intensive and requires a significant amount of domain knowledge, ...
Gregory Hornby, Jason D. Lohn, Derek S. Linden