54 search results - page 5 / 11 » Hardness of Approximating the Closest Vector Problem with Pr... |
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
132
Voted
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
72
Voted
COLT
1999
Springer
15 years 1 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...