Sciweavers

561 search results - page 13 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
JSC
2006
102views more  JSC 2006»
13 years 8 months ago
Counterexamples to witness conjectures
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
Joris van der Hoeven
NIPS
2000
13 years 9 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
SBACPAD
2003
IEEE
138views Hardware» more  SBACPAD 2003»
14 years 1 months ago
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
 This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
João Paulo De Angeli, Andréa M. P. V...
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
13 years 10 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
ASAP
2004
IEEE
160views Hardware» more  ASAP 2004»
14 years 5 days ago
Architectural Support for Arithmetic in Optimal Extension Fields
Public-key cryptosystems generally involve computation-intensive arithmetic operations, making them impractical for software implementation on constrained devices such as smart ca...
Johann Großschädl, Sandeep S. Kumar, Ch...