Steve Hanov personal blog
VP trees: A data structure for finding stuff fast
<img src="http://stevehanov.ca/wavelet/cup.png"/> Let's say you have millions of pictures of faces tagged with names. Given a new photo, how do you find the name of person that the photo most resembles? <p> In the cases I mentioned, each record has hundreds or thousands of elements: the pixels in a photo, or patterns…
- Points
- 102
- HN comments
- 9
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2011
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Dec 2, 2011 | VP trees: A data structure for finding stuff fast by rcfox | 102 | 9 |
