Almost Optimal Explicit Johnson-Lindenstrauss Families

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22935-0_53
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, but Not Quite

2009English

The Johnson-Lindenstrauss Transform: An Empirical Study

2011English

Dimensionality Reduction: Beyond the Johnson-Lindenstrauss Bound

2011English

The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

SIAM Journal on Computing
MathematicsComputer Science
2009English

Definability and Almost Disjoint Families

Advances in Mathematics
Mathematics
2018English

Splitting Strongly Almost Disjoint Families

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

ALMOST OPTIMAL SOLUTIONS TO K-Clustering PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2010English

An Almost Optimal Algorithm for Computing Nonnegative Rank

2013English

Almost Optimal Set Covers in Finite VC-dimension

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy