1319 search results - page 79 / 264 » Recursive Random Fields |
114
Voted
STOC
1998
ACM
15 years 5 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
108
click to vote
CHES
2010
Springer
15 years 28 days ago
2010
Springer
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
83
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
111
Voted
ILP
2005
Springer
15 years 6 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
130
click to vote
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...