Sciweavers

237 search results - page 28 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
MICCAI
2000
Springer
13 years 11 months ago
Fusing Speed and Phase Information for Vascular Segmentation in Phase Contrast MR Angiograms
This paper presents a statistical approach to aggregating speed and phase (directional) information for vascular segmentation in phase contrast magnetic resonance angiograms (PC-MR...
Albert C. S. Chung, J. Alison Noble, Paul E. Summe...
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Computing Sparse Multiples of Polynomials
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[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 8 months ago
Pseudorandom generators for low degree polynomials
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...
Andrej Bogdanov
FOCS
1992
IEEE
13 years 11 months ago
Efficient Inference of Partial Types
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...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...