Optimal (Euclidean) Metric Compression
From MaRDI portal
Publication:5080486
DOI10.1137/20M1371324OpenAlexW3203560892WikidataQ114074150 ScholiaQ114074150MaRDI QIDQ5080486
Publication date: 31 May 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.03152
Discrete geometry (52C99) Data structures (68P05) Metric embeddings as related to computational problems and algorithms (68R12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sparse spanners of weighted graphs
- The space complexity of approximating the frequency moments
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Euclidean quotients of finite metric spaces
- On the distortion required for embedding finite metric spaces into normed spaces
- Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
- Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
- Approximate Distance Oracles with Improved Bounds
- Extensions of Lipschitz mappings into a Hilbert space
- Approximate distance oracles
- Graph spanners
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Probabilistic clustering of high dimensional norms
- Near-Optimal (Euclidean) Metric Compression
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Optimal terminal dimensionality reduction in Euclidean space
- Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices
- Nonlinear dimension reduction via outer Bi-Lipschitz extensions
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Optimal (Euclidean) Metric Compression
