/explore
|
You are here 
|
www.cs.ubc.ca | ||
| | | | |
0x65.dev
Optimizing memory-usage for approximate nearest neighbor search |
|
| | | | | ||
| | | | |
jmlr.org
|
|
| | | | | ||
| | | | |
kevinkle.in
Using Approximate Nearest Neighbors to stitch images to images |
|
| | | | | ||
| | | | |
erikbern.com
One of my super nerdy interests include approximate algorithms for nearest neighbors in high-dimensional spaces. The problem is simple. You have say 1M points in some high-dimensional space. Now given a query point, can you find the nearest points out of the 1M set? Doing this fast turns out to be tricky. |
|
| | | |||
