Approximate nearest neighbor search for -spaces (2<p<∞).

Theoretical Computer Science（2019）

引用 4|浏览34

暂无评分

摘要

While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2更多

查看译文

关键词

Nearest neighbor search,ℓp spaces

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要