284 search results - page 3 / 57 » Modularity of Completeness Revisited |
154
Voted
ICCS
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents a system for generating user tailored evaluative arguments, known as the Generator of Evaluative Arguments (GEA). GEA design is based on a pipelined architectur...
JSC
2010
15 years 4 months ago
2010
133
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
149
click to vote
EUROCAST
1997
Springer
15 years 9 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
172
click to vote
INDOCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called com...