Sciweavers

22 search results - page 5 / 5
» A connection between cutting plane theory and the geometry o...
Sort
View
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 7 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
FOCS
2007
IEEE
14 years 3 days ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
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...
Jonathan A. Kelner, Evdokia Nikolova