6251 search results - page 422 / 1251 » Randomness, Computability, and Density |
189
click to vote
IPPS
2006
IEEE
16 years 26 days ago
2006
IEEE
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
201
click to vote
LCN
2006
IEEE
16 years 25 days ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
190
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
198
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
196
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...