[mlpack-git] [mlpack/mlpack] Universal B tree implementation (#746)
notifications at github.com
Tue Aug 23 08:30:48 EDT 2016
> - hiBound(k, numBounds) = std::min(bounds[k].Hi(), hiCorner[k]);
> + for (size_t i = 0; i < data.n_cols; i++)
Indeed, that provides some benefits. If I am not mistaken, the minimum bounding rectangle is used in the `Contains()` function but I can replace that by the hyperrectangles.
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the mlpack-git