Two Efficient Hashing Schemes for High-Dimensional Furthest Neighbor Search.
IEEE Transactions on Knowledge and Data Engineering(2017)
摘要
The $c$ -Approximate Furthest Neighbor ( $c$ -AFN) search is a fundamental problem in many applications. However, existing hashing schemes for $c$ -AFN search are designed for internal memory. The old techniques for external memory, such as furthest point Voronoi diagram and the tree-based methods, are only suitable for the low-dimensional case. In this paper, we introduce a novel concept of the R...
更多查看译文
关键词
Search problems,Data structures,Object recognition,Euclidean distance,Nearest neighbor searches,Query processing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络