Approximate Nearest Neighbor Search for Low Dimensional Queries

Details Approximate Nearest Neighbor Search for Low Dimensional Queries Approximate Nearest Neighbor Search for Low Dimensional Queries

2010-07-19

arxiv.org/abs/1007.3296v2

Computer Science

Computational Geometry

24 pages

Scientific paper

We study the Approximate Nearest Neighbor problem for metric spaces where the
query points are constrained to lie on a subspace of low doubling dimension.

Affiliated with

Also associated with

No associations

Rating

Approximate Nearest Neighbor Search for Low Dimensional Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Nearest Neighbor Search for Low Dimensional Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Nearest Neighbor Search for Low Dimensional Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124755