101
click to vote
STOC
16 years 1 months ago
2009 ACM 
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
118
Voted
STOC
15 years 7 months ago
2009 ACM 
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
123
Voted
STOC
16 years 1 months ago
2009 ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
107
click to vote
STOC
16 years 1 months ago
2009 ACM 
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
|
Algorithms