Sciweavers

861 search results - page 12 / 173
» Faster integer multiplication
Sort
View
ASAP
2008
IEEE
96views Hardware» more  ASAP 2008»
16 years 9 days ago
Integer and floating-point constant multipliers for FPGAs
Reconfigurable circuits now have a capacity that allows them to be used as floating-point accelerators. They offer massive parallelism, but also the opportunity to design optimi...
Nicolas Brisebarre, Florent de Dinechin, Jean-Mich...
160
Voted
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
15 years 12 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
15 years 10 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
161
Voted
JCO
2000
116views more  JCO 2000»
15 years 5 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
Piotr Berman, Bhaskar DasGupta
143
Voted
CC
2006
Springer
101views System Software» more  CC 2006»
15 years 9 months ago
SARA: Combining Stack Allocation and Register Allocation
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...
V. Krishna Nandivada, Jens Palsberg