Sciweavers

5864 search results - page 82 / 1173
» Can We Work around Numerical Methods
Sort
View
119
Voted
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
15 years 8 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
163
Voted
FOCM
2008
100views more  FOCM 2008»
15 years 4 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
ARITH
2003
IEEE
15 years 9 months ago
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Jean-Michel Muller
101
Voted
HICSS
2006
IEEE
99views Biometrics» more  HICSS 2006»
15 years 10 months ago
The Effect of Time Separation on Coordination Processes and Outcomes: A Case Study
Prior research has discussed and investigated how global teams bridge multiple boundaries (e.g., distance, time, culture) that separate its members and impact the coordination of ...
J. Alberto Espinosa, Cynthia Pickering
JSCIC
2007
89views more  JSCIC 2007»
15 years 3 months ago
Dispersion and Dissipation Error in High-Order Runge-Kutta Discontinuous Galerkin Discretisations of the Maxwell Equations
Different time-stepping methods for a nodal high-order discontinuous Galerkin discretisation of the Maxwell equations are discussed. A comparison between the most popular choices o...
D. Sármány, M. A. Botchev, Jaap J. W...