709 search results - page 69 / 142 » On LR(k)-Parsers of Polynomial Size |
AAAI
1996
14 years 11 months ago
1996
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
ALGORITHMICA
2007
14 years 10 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
IACR
2011
13 years 9 months ago
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
180
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...