[mlpack-git] [mlpack/mlpack] Approximate Neighbor Search for Dual tree algorithms. (#684)

[MarcosPividori]

> @@ -419,6 +423,8 @@ inline double NeighborSearchRules<SortPolicy, MetricType, TreeType>::
>    queryNode.Stat().SecondBound() = bestDistance;
>    queryNode.Stat().AuxBound() = auxDistance;
>  
> +  worstDistance = SortPolicy::Relax(worstDistance, epsilon);

Yeah! I see what you mean. Maybe we could consider that in the future.

---
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/684/files/07879a2cc79b35b10d7fae687d6e27ad90a9f2d7#r66710779
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160611/d43d96cf/attachment.html>