Classifications
Algorithms
Paradigms
Onto Viz
AlgPedians
Rules
Login
Search Algorithms
About:
(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest neighbor search is a point or multiple points within distance (1+ε) R from a query point, where R is the distance between the query point and its true nearest neighbor.[1]
[More Information]
Implementations :
There are no implementations available for this algorithm yet.
×
About the speed performance (complexity)?
1
2
3
4
5
How much readable is this code?
1
2
3
4
5
This code compiles?
No
Yes