[mlpack-git] [mlpack/mlpack] LSH optimization: LSHSearch::ReturnIndicesFromTable uses less memory (#623)

[Ryan Curtin]

Yeah, just counting the number of reference points to be searched should be small compared to the work of actually doing those calculations, since all we need to do is O(number of tables to search) loops with O(1) work inside of the loop body.  That should take virtually no time compared to each O(d) distance calculation, of which there will be many.

---
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/623#issuecomment-223830617
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160605/47347c0a/attachment.html>