[mlpack-git] master, mlpack-1.0.x: Update the line about dual-tree algorithms being faster. 'cause they are. (c5965b5)

[gitdub at big.cc.gt.atl.ga.us]

Repository : https://github.com/mlpack/mlpack

On branches: master,mlpack-1.0.x
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

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

commit c5965b5bf4073592bd9713ea5c56deaf9bd69129
Author: Ryan Curtin <ryan at ratml.org>
Date:   Wed Feb 19 22:17:10 2014 +0000

    Update the line about dual-tree algorithms being faster.  'cause they are.


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

c5965b5bf4073592bd9713ea5c56deaf9bd69129
 HISTORY.txt | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/HISTORY.txt b/HISTORY.txt
index e85ab16..a4e909b 100644
--- a/HISTORY.txt
+++ b/HISTORY.txt
@@ -10,7 +10,8 @@
 
   * Fixed implementation of Viterbi algorithm in HMM::Predict() (#316).
 
-  * Significant speedups for dual-tree algorithms using the cover tree (#243).
+  * Significant speedups for dual-tree algorithms using the cover tree (#243,
+    #329) including a faster implementation of FastMKS.
 
   * Fix for LRSDP optimizer so that it compiles and can be used (#325).