High-dimensional approximate \(r\)-nets

DOI10.1007/s00453-019-00664-8zbMath1433.68479OpenAlexW3005430834MaRDI QIDQ1987244

Z. Avarikioti, Ioannis Z. Emiris, L. Kavouras, Ioannis Psarros

Publication date: 14 April 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00664-8

zbMATH Keywords

approximation algorithmmetric geometrygeneral dimensionlocality-sensitive hashing\(r\)-nets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rectangular matrix multiplication revisited
• Clustering motion
• Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
• Net and Prune
• Approximate Greedy Clustering and Distance Selection for Graph Metrics
• Similarity estimation techniques from rounding algorithms
• High-dimensional approximate r-nets
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Fast construction of nets in low dimensional metrics, and their applications
• Probability and Computing

This page was built for publication: High-dimensional approximate \(r\)-nets