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

sounds a lot like gaussian kd-trees

http://graphics.stanford.edu/papers/gkdtrees/gkdtrees.pdf

Instead of doing a brute force nearest neighbor search, samples are propagated through a tree.

This technique is exotic, but not new.



Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

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

Search: