23 search results - page 4 / 5 » Oblivious Polynomial Evaluation and Oblivious Neural Learnin... |
TIT
2008
14 years 9 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
119
Voted
TCC
2007
Springer
15 years 3 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
LCPC
2007
Springer
15 years 3 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
COLT
2004
Springer
15 years 2 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
110
click to vote
IJDAR
2002
14 years 9 months ago
2002
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...