72 search results - page 12 / 15 » A Modular Method for Computing the Splitting Field of a Poly... |
VLSID
2009
IEEE
14 years 8 months ago
2009
IEEE
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
CPHYSICS
2008
13 years 7 months ago
2008
A scalable parallel algorithm has been designed to perform multimillion-atom molecular dynamics (MD) simulations, in which first principlesbased reactive force fields (ReaxFF) des...
PKC
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ISORC
1999
IEEE
13 years 12 months ago
1999
IEEE
Designing distributed real-time systems as being composed of communicating objects offers many advantages with respect to modularity and extensibility of these systems. However, d...