/explore
|
You are here 
|
jmlr.org | ||
| | | | |
erikbern.com
Approximate nearest neighbor search is very useful when you have a large dataset of millions of datapoints and you learn some kind of vector representation of these items. I built a benchmark suite called ann-benchmarks. It pits a number of algorithms in a brutal showdown. |
|
| | | | | ||
| | | | |
0x65.dev
Optimizing memory-usage for approximate nearest neighbor search |
|
| | | | | ||
| | | | |
www.cs.ubc.ca
|
|
| | | | | ||
| | | | |
softwaredoug.com
A week of wector wevents - vector retrieval, hybrid search, combining the dense and lexical. |
|
| | | |||
