Approximate k -flat Nearest Neighbor Search

DOI10.1145/2746539.2746559zbMath1321.68416arXiv1411.1519OpenAlexW2109701014MaRDI QIDQ2941574

No author found.

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

high dimensionsapproximate nearest neighbors\(k\)-flat

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Approximate k -flat Nearest Neighbor Search