scientific article; zbMATH DE number 6866343

DOI10.4230/LIPICS.ITCS.2017.53zbMath1402.68186arXiv1602.06922MaRDI QIDQ4638108

Rachel Ward, Christopher A. Kennedy

Publication date: 3 May 2018

Full work available at URL: https://arxiv.org/abs/1602.06922

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dimension reductionlocality-sensitive hashingJohnson-Lindenstrauss transform

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General topics in the theory of data (68P01)

Related Items (3)

Index structures for fast similarity search for real-valued vectors. I ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Problems and results in extremal combinatorics. I.
• A randomized approximate nearest neighbors algorithm
• Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
• Optimal Data-Dependent Hashing for Approximate Near Neighbors
• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• Sparser Johnson-Lindenstrauss Transforms
• Extensions of Lipschitz mappings into a Hilbert space
• Efficient algorithms for substring near neighbor problem
• Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
• The Restricted Isometry Property of Subsampled Fourier Matrices
• The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Locality-sensitive hashing scheme based on p-stable distributions
• Beyond Locality-Sensitive Hashing

This page was built for publication: