2745 search results - page 120 / 549 » A fast algorithm for computing large Fibonacci numbers |
124
Voted
ICSE
2001
IEEE-ACM
15 years 8 months ago
2001
IEEE-ACM
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
167
click to vote
ASAP
2004
IEEE
15 years 7 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
117
click to vote
CARDIS
2008
Springer
15 years 5 months ago
2008
Springer
Digital signatures are one of the most important applications of microprocessor smart cards. The most widely used algorithms for digital signatures, RSA and ECDSA, depend on finite...
135
click to vote
JMM2
2006
15 years 3 months ago
2006
In this article, we present some development results of a system that performs mosaicing (or mosaicking) of panoramic faces. Our objective is to study the feasibility of panoramic ...
114
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...