[WIP] Locality Sensitive Hashing for approximate nearest neighbor search(GSoC)

I don't think we should require completely independent gaussian random projections for each tree. While the trees will not be entirely independent, surely many complementary trees (in the sense of increasing recall) can be built just by permuting the bits in one of your existing hash functions.