Sciweavers

610 search results - page 37 / 122
» Fast Modular Reduction
Sort
View
FCCM
1998
IEEE
99views VLSI» more  FCCM 1998»
15 years 1 months ago
FPGA-Based Architecture Evaluation of Cryptographic Coprocessors for Smartcards
In 1996, about 600 million IC-cards were manufactured worldwide. Due to very small die sizes (max. 25 mm2 ) smartcards encounter more severe restrictions than conventional coproces...
Hagen Ploog, Dirk Timmermann
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 10 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
Sean Hallgren
78
Voted
ICASSP
2008
IEEE
15 years 4 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
ARITH
2005
IEEE
15 years 3 months ago
A Fast-Start Method for Computing the Inverse Tangent
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
Peter W. Markstein
PR
2007
194views more  PR 2007»
14 years 9 months ago
Decolorize: Fast, contrast enhancing, color to grayscale conversion
We present a new contrast enhancing color to grayscale conversion algorithm which works in real-time. It incorporates novel techniques for image sampling and dimensionality reduct...
Mark Grundland, Neil A. Dodgson