[mlpack-git] (blog) master: Fix details. (aeba3dc)

gitdub at mlpack.org gitdub at mlpack.org
Tue Aug 23 02:03:33 EDT 2016


Repository : https://github.com/mlpack/blog
On branch  : master
Link       : https://github.com/mlpack/blog/compare/ba5ffd0e6fda547d9f193c730e4900a9fc1de081...aeba3dce1ee62e94c1e10fbbdb83332afcc4fd7b

>---------------------------------------------------------------

commit aeba3dce1ee62e94c1e10fbbdb83332afcc4fd7b
Author: MarcosPividori <marcos.pividori at gmail.com>
Date:   Tue Aug 23 03:03:33 2016 -0300

    Fix details.


>---------------------------------------------------------------

aeba3dce1ee62e94c1e10fbbdb83332afcc4fd7b
 content/blog/MarcosFinal.md | 40 ++++++++++++++++++++--------------------
 1 file changed, 20 insertions(+), 20 deletions(-)

diff --git a/content/blog/MarcosFinal.md b/content/blog/MarcosFinal.md
index 0f1c3b7..318fcf1 100644
--- a/content/blog/MarcosFinal.md
+++ b/content/blog/MarcosFinal.md
@@ -7,26 +7,26 @@ I have been working this summer on the GSoC Project:
 "Approximate Nearest Neighbor Search" (Project site: [[1]][1]).
 
 The main contribution can be summarized in these pull requests:
- + [[pull/768]][pull/768]  (Api details)
- + [[pull/766]][pull/766]  (Fix furthest neighbor sort policy)
- + [[pull/765]][pull/765]  (Api improvement - move semantics)
- + [[pull/764]][pull/764]  (Fix tests)
- + [[pull/762]][pull/762]  (Greedy Traverser)
- + [[pull/747]][pull/747]  (Spill trees Implementation)
- + [[pull/732]][pull/732]  (Heaps for mlpack)
- + [[pull/731]][pull/731]  (Fix memory leak)
- + [[pull/727]][pull/727]  (Fix TreeTrait for BallTree)
- + [[pull/693]][pull/693]  (Modify NSModel to use boost variant)
- + [[pull/684]][pull/684]  (Approx KNN for Dual tree algorithms)
- + [[pull/682]][pull/682]  (Properly resetting auxBound)
- + [[pull/668]][pull/668]  (Add B_aux according to issue #642)
- + [[pull/655]][pull/655]  (Fix erroneous ball tree definition)
- + [[pull/646]][pull/646]  (Remove duplicated code for traversal info)
- + [[pull/645]][pull/645]  (Properly use Enum type)
- + [[pull/637]][pull/637]  (Fix a mistake in metric policy)
- + [[pull/19]][pull/19]  (Improve programs for ANN and FLANN)
- + [[pull/17]][pull/17]  (Approx KNN for the benchmarking system)
- + [[pull/14]][pull/14]  (Add Num of BaseCases as a metric)
+ * [[pull/768]][pull/768]  (Api details)
+ * [[pull/766]][pull/766]  (Fix furthest neighbor sort policy)
+ * [[pull/765]][pull/765]  (Api improvement - move semantics)
+ * [[pull/764]][pull/764]  (Fix tests)
+ * [[pull/762]][pull/762]  (Greedy Traverser)
+ * [[pull/747]][pull/747]  (Spill trees Implementation)
+ * [[pull/732]][pull/732]  (Heaps for mlpack)
+ * [[pull/731]][pull/731]  (Fix memory leak)
+ * [[pull/727]][pull/727]  (Fix TreeTrait for BallTree)
+ * [[pull/693]][pull/693]  (Modify NSModel to use boost variant)
+ * [[pull/684]][pull/684]  (Approx KNN for Dual tree algorithms)
+ * [[pull/682]][pull/682]  (Properly resetting auxBound)
+ * [[pull/668]][pull/668]  (Add B_aux according to issue #642)
+ * [[pull/655]][pull/655]  (Fix erroneous ball tree definition)
+ * [[pull/646]][pull/646]  (Remove duplicated code for traversal info)
+ * [[pull/645]][pull/645]  (Properly use Enum type)
+ * [[pull/637]][pull/637]  (Fix a mistake in metric policy)
+ * [[pull/19]][pull/19]  (Improve programs for ANN and FLANN)
+ * [[pull/17]][pull/17]  (Approx KNN for the benchmarking system)
+ * [[pull/14]][pull/14]  (Add Num of BaseCases as a metric)
 
 (List of commits: [[link]][commitlist])
 




More information about the mlpack-git mailing list