Sciweavers

237 search results - page 43 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
GPC
2007
Springer
14 years 1 months ago
Optimal Deployment of Mobile Sensor Networks and Its Maintenance Strategy
Abstract. Sensor network deployment and its maintenance are very challenging due to hostile and unpredictable nature of environments. The field coverage of a wireless sensor networ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
13 years 12 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...
SC
1993
ACM
13 years 11 months ago
Solving the Boltzmann equation at 61 gigaflops on a 1024-node CM-5
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
Lyle N. Long, Jacek Myczkowski
CIS
2006
Springer
13 years 11 months ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto