3379 search results - page 229 / 676 » Powers of Two |
178
click to vote
ISMIS
2009
Springer
16 years 1 months ago
2009
Springer
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to uncertain inputs, is used to re...
186
click to vote
STACS
2007
Springer
16 years 21 days ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
173
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
145
click to vote
FCT
1999
Springer
15 years 11 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
221
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
The high performance of the conventional spatio-temporal image noise reduction filers comes at the cost of high computationally intensity. In this paper, a motion adaptive spatio-...