6251 search results - page 1122 / 1251 » Randomness, Computability, and Density |
131
Voted
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
149
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
163
Voted
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
130
Voted
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
136
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...