6381 search results - page 362 / 1277 » Alternative Implementation of the C |
166
click to vote
FIWAC
1993
15 years 11 months ago
1993
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
212
click to vote
DCC
1992
IEEE
15 years 11 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
178
click to vote
POPL
1993
ACM
15 years 11 months ago
1993
ACM
Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings locations across indepe...
154
click to vote
CGO
2004
IEEE
15 years 11 months ago
2004
IEEE
Performing analysis across module boundaries for an entire program is important for exploiting several runtime performance opportunities. However, due to scalability problems in e...
205
click to vote
DFT
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper presents a novel delay fault testing technique, which can be used as an alternative to the enhanced scan based delay fault testing, with significantly less design overh...