Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It makes it possible to approximate k-nearest neighbor vector search without having to calculate cosine similarity, dot product or euclidean distance for all stored vectors on the fly.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: