17129 search results - page 359 / 3426 » Applied Computing |
173
click to vote
ARITH
2003
IEEE
16 years 2 hour ago
2003
IEEE
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...
180
click to vote
UIC
2009
Springer
16 years 1 months ago
2009
Springer
Document printing has long been considered an indispensable part of the workspace. While this process is considered trivial and simple for environments where resources are ample (e...
168
click to vote
SAC
2009
ACM
2009
ACM
On the practical importance of communication complexity for secure multi-party computation protocols
16 years 1 months ago
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
160
click to vote
GC
2004
Springer
16 years 2 days ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
139
click to vote
SAC
2005
ACM
16 years 8 days ago
2005
ACM
Finding the appropriate location of adaptation points for computation migration/checkpointing is critical since the distance between two consecutive adaptation points determines t...