524 search results - page 15 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
141
click to vote
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
209
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
168
click to vote
OPODIS
2008
15 years 7 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
166
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
158
click to vote
IJCAI
2007
15 years 7 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...