10493 search results - page 150 / 2099 » Dynamic Word Problems |
AAAI
1994
13 years 9 months ago
1994
This paper conjectures a computational account of how children might learn the meanings of words in their native language. First, a simplified version of the lexical acquisition t...
PRL
2006
13 years 8 months ago
2006
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
SAC
1997
ACM
14 years 8 days ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...