79 search results - page 5 / 16 » Piercing random boxes |
SOSP
2003
ACM
14 years 5 months ago
2003
ACM
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
DSN
2004
IEEE
14 years 5 days ago
2004
IEEE
Advanced molecular nanotechnology devices are expected to have exceedingly high transient fault rates and large numbers of inherent device defects compared to conventional CMOS de...
CRYPTO
2007
Springer
14 years 2 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...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
SIAMCOMP
2011
13 years 3 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...