237 search results - page 28 / 48 » Algorithms for Exponentiation in Finite Fields |
113
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
MICCAI
2000
Springer
15 years 3 months ago
2000
Springer
This paper presents a statistical approach to aggregating speed and phase (directional) information for vascular segmentation in phase contrast magnetic resonance angiograms (PC-MR...
107
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
117
click to vote
STOC
2005
ACM
16 years 3 days ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...