/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

0x65.dev
| | ravendb.net

RavenDB 7.0 introduces vector search using the Hierarchical Navigable Small World (HNSW) algorithm, a graph-based approach for Approximate Nearest Neighbor s...
1.6 parsecs

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

Travel
| |
| | erikbern.com

This is a blog post rewritten from a presentation at NYC Machine Learning last week. It covers a library called Annoy that I have built that helps you do (approximate) nearest neighbor queries in high dimensional spaces.
1.7 parsecs

Travel
| |
| | avivace.com

How to mix plain markdown and latex and get beautiful results while writing human stuff. (with results being PDF, XHTML, HTML5, docx, EPUB, LaTex and many more). Pandoc allows you to get the best of the two worlds without compromises: readable plain text files with latex expressions and everything offered by latex rendering and packages. You can write code-blocks with specific language syntax highlight, normal markdown and LaTex parts. To place something written in TeX in mathmode, use $ signs to enclose the math you want to display, exactly what you would do in a normal LaTex file.
23.5 parsecs

Travel
|