612 search results - page 42 / 123 » Hardness assumptions in the foundations of theoretical compu... |
SC
2005
ACM
14 years 1 months ago
2005
ACM
We are developing Virtuoso, a system for distributed computing using virtual machines (VMs). Virtuoso must be able to mix batch and interactive VMs on the same physical hardware, ...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
GI
2007
Springer
14 years 2 months ago
2007
Springer
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
ASAP
1997
IEEE
13 years 11 months ago
1997
IEEE
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. Little work has been devoted to ...
EUROCRYPT
2001
Springer
14 years 11 days ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...