Approximate near neighbors for general symmetric norms-Reference-Cited by-同舟云学术

Approximate near neighbors for general symmetric norms

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Andoni Alexandr¹,Nguyen Huy L.²,Nikolov Aleksandar³,Razenshteyn Ilya⁴,Waingarten Erik¹

Affiliation:

1. Columbia University, USA

2. Northeastern University, USA

3. University of Toronto, Canada

4. Massachusetts Institute of Technology, USA

Funder

National Science Foundation

Google

Simons Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055418

Reference61 articles.

1. A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds

2. Alexandr Andoni. 2009. Alexandr Andoni. 2009.

3. Nearest Neighbor Search: the Old the New and the Impossible. Ph.D. Dissertation. MIT. Nearest Neighbor Search: the Old the New and the Impossible. Ph.D. Dissertation. MIT.

4. Hardness of Nearest Neighbor under L-infinity

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Supermodular Approximation of Norms and Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Exposé Bourbaki 1188 : Average distortion embeddings, nonlinear spectral gaps, and a metric John theorem [after Assaf Naor];Astérisque;2023-04-04

3. Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1;Theoretical Computer Science;2023-01

4. An average John theorem;Geometry & Topology;2021-07-12

5. A framework for quadratic form maximization over convex sets through nonconvex relaxations;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15