Approximate furthest neighbor with application to annulus query

作者：

Highlights：

• Presents the approximate furthest neighbor problem (AFN).

• Gives sub-linear time solutions to AFN based on random projections.

• Presents the approximate annulus query problem (AAQ).

• Gives a sub-linear time solution to AAQ based on random projections and locality sensitive hashing.

摘要

Highlights•Presents the approximate furthest neighbor problem (AFN).•Gives sub-linear time solutions to AFN based on random projections.•Presents the approximate annulus query problem (AAQ).•Gives a sub-linear time solution to AAQ based on random projections and locality sensitive hashing.

论文关键词：

论文评审过程：Received 30 November 2015, Revised 24 May 2016, Accepted 12 July 2016, Available online 22 July 2016, Version of Record 20 December 2016.

论文官网地址：https://doi.org/10.1016/j.is.2016.07.006