315 search results - page 22 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
118
click to vote
CIARP
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
155
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
83
Voted
VRCAI
2006
ACM
15 years 6 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
103
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...