News for hackers. Stuff that matters.
Re:Damn Cool Algorithms, Part 1: BK-Trees by wgd on Monday December 05, 2011 @06:21PM (#3317010)
This seems similar to the VP-Tree, which there was a post about a few days ago, except that VP-Trees use binary partitioning because they're measuring similarity in a continuous space, while these ones use discrete buckets because similarity is measured discretely.
Re:Damn Cool Algorithms, Part 1: BK-Trees by gujk on Monday December 05, 2011 @11:34PM (#3317903)
The VP article linked to this one as background material. That is where OP found this article to repost for karma.