Finding smallest angle between vectors in logarithmic time.
Posted
by Christian
on Stack Overflow
See other posts from Stack Overflow
or by Christian
Published on 2010-05-21T14:57:00Z
Indexed on
2010/05/21
15:40 UTC
Read the original article
Hit count: 173
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)
?
© Stack Overflow or respective owner