Sketching and Embedding are Equivalent for Norms

DOI10.1145/2746539.2746552zbMath1321.68428arXiv1411.2577OpenAlexW2962922559MaRDI QIDQ2941540

Robert Krauthgamer, Alexandr Andoni, Ilya Razenshteyn

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.2577

zbMATH Keywords

high-dimensional geometrysublinear algorithmsmetric embeddingssketchesstreaming algorihms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Binary vectors for fast distance and similarity estimation ⋮ Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature ⋮ Unnamed Item ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Uniform nonextendability from nets ⋮ On Approximating Matrix Norms in Data Streams

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: Sketching and Embedding are Equivalent for Norms