|
You are here |
erikbern.com | ||
| | | | |
0x65.dev
|
|
| | | | | Optimizing memory-usage for approximate nearest neighbor search | |
| | | | |
jmlr.org
|
|
| | | | | ||
| | | | |
randorithms.com
|
|
| | | | | There are too many near neighbor problem statements. There. I said it. When I first tried to read about this, it took me forever to understand all the differ... | |
| | | | |
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. | ||