588 search results - page 79 / 118 » Reducibility and Completeness in Private Computations |
PVM
2001
Springer
14 years 2 months ago
2001
Springer
Parallel IO (PIO) support for larger scale computing is becoming more important as application developers better understand its importance in reducing overall execution time by avo...
AIPS
2003
13 years 11 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...
ICS
2009
Tsinghua U.
14 years 4 months ago
2009
Tsinghua U.
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...
FSTTCS
1992
Springer
14 years 2 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
CN
2007
13 years 10 months ago
2007
Self-protecting systems require the ability to instantaneously detect malicious activity at run-time and prevent execution. We argue that it is impossible to perfectly self-protec...