1941 search results - page 115 / 389 » On the Hardness of Approximate Reasoning |
145
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
145
click to vote
PKC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...
189
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
141
click to vote
ACL
1998
15 years 7 months ago
1998
An essential step in comparative reconstruction is to align corresponding phonological segments in the words being compared. To do this, one must search among huge numbers of pote...
136
click to vote
ENTCS
2007
15 years 6 months ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...