/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.cs.ubc.ca
| | kevinkle.in
3.2 parsecs away

Travel
| | Using Approximate Nearest Neighbors to stitch images to images
| | blog.vespa.ai
6.9 parsecs away

Travel
| | From text search and recommendation to ads and online dating, ANN search rarely works in isolation.
| | erikbern.com
1.7 parsecs away

Travel
| | Annoy is a library written by me that supports fast approximate nearest neighbor queries. Say you have a high (1-1000) dimensional space with points in it, and you want to find the nearest neighbors to some point.
| | erikbern.com
15.7 parsecs away

Travel
| 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.