Pages that link to "Item:Q4507359"

The following pages link to Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (Q4507359):

Displaying 43 items.

• Indexability, concentration, and VC theory (Q450514) (← links)
• A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
• Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
• A Gaussian small deviation inequality for convex functions (Q1647733) (← links)
• Efficient clustering on Riemannian manifolds: a kernelised random projection approach (Q1669725) (← links)
• Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
• Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data (Q2032151) (← links)
• Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance (Q2128423) (← links)
• Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
• Dimension reduction by random hyperplane tessellations (Q2250053) (← links)
• An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
• Index structures for fast similarity search for symbol strings (Q2287426) (← links)
• Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
• The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite (Q2380779) (← links)
• Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
• Approximate range searching in higher dimension (Q2456663) (← links)
• Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
• Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality? (Q2629451) (← links)
• Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
• Parallel algorithms for nearest neighbor search problems in high dimensions (Q2830635) (← links)
• Approximate nearest neighbor search for low-dimensional queries (Q2839174) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
• A Heterogeneous High-Dimensional Approximate Nearest Neighbor Algorithm (Q2989754) (← links)
• The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
• Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere (Q3603512) (← links)
• (Q4533705) (← links)
• Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
• Efficient Nearest Neighbors via Robust Sparse Hashing (Q4592402) (← links)
• Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
• (Q5002756) (← links)
• One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
• Optimal (Euclidean) Metric Compression (Q5080486) (← links)
• Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
• (Q5111687) (← links)
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances (Q5236204) (← links)
• (Q5365086) (← links)
• Comparison of Metric Spectral Gaps (Q5402099) (← links)
• Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
• On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions (Q6072195) (← links)
• (Q6084405) (← links)
• (Q6124766) (← links)