Q4638108 (Q4638108): Difference between revisions

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