Finding smallest angle between vectors in logarithmic time.
- by Christian
I have n=10000 10 dimensional vectors.
For every vector v1 I want to know the vector v2 that minimizes the angle between v1 and v2.
Is there a way to solve this problem faster than O(n^2)?