Sciweavers

308 search results - page 2 / 62
» How Fast Is the k-Means Method
Sort
View
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
13 years 11 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
JAL
1998
74views more  JAL 1998»
13 years 5 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
EMMCVPR
2003
Springer
13 years 10 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
ISQED
2007
IEEE
372views Hardware» more  ISQED 2007»
13 years 11 months ago
From Finance to Flip Flops: A Study of Fast Quasi-Monte Carlo Methods from Computational Finance Applied to Statistical Circuit
Problems in computational finance share many of the characteristics that challenge us in statistical circuit analysis: high dimensionality, profound nonlinearity, stringent accura...
Amith Singhee, Rob A. Rutenbar
VISUALIZATION
2000
IEEE
13 years 9 months ago
Fast visualization methods for comparing dynamics: a case study in combustion
Visualization can be an important tool for displaying, categorizing and digesting large quantities of inter-related information during laboratory and simulation experiments. Summa...
Kay A. Robbins, Michael Gorman