Sciweavers

793 search results - page 3 / 159
» Efficient computation of the characteristic polynomial
Sort
View
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 9 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
MICCAI
2008
Springer
14 years 8 months ago
Efficient Computation of PDF-Based Characteristics from Diffusion MR Signal
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
David Tschumperlé, Haz-Edine Assemlal, Luc ...
COMPUTING
2006
127views more  COMPUTING 2006»
13 years 7 months ago
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of t...
T. Gunji, S. Kim, K. Fujisawa, M. Kojima
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 11 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 11 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen