no code implementations • 2 Oct 2016 • Noga Alon, Bo'az Klartag
On the positive side, we provide a randomized polynomial time algorithm for a bipartite variant of the Johnson-Lindenstrauss lemma in which scalar products are approximated up to an additive error of at most $\varepsilon$.
Metric Geometry Combinatorics
