595 search results - page 82 / 119 » Languages Of Analogical Strings |
CIE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
DM
2010
14 years 9 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
ENTCS
2008
14 years 9 months ago
2008
There are several proposals for extending Prolog with functional capabilities. The basic idea is to enlarge the language with function definitions that are translated (or expanded...
JFP
2008
14 years 9 months ago
2008
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
This paper reviews the recent developments in applying geometric and quantum mechanics methods for information retrieval and natural language processing. It discusses the interest...