704 search results - page 7 / 141 » Learning the Ideal Evaluation Function |
88
Voted
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
88
Voted
DAC
2010
ACM
15 years 1 months ago
2010
ACM
The level of security provided by digital rights management functions and cryptographic protocols depend heavily on the security of an embedded secret key. The current practice of...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
92
Voted
STOC
2003
ACM
15 years 10 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...