[shark] 03/79: typo corrected

[Ghislain Vaillant]

This is an automated email from the git hooks/post-receive script.

ghisvail-guest pushed a commit to branch master
in repository shark.

commit 97954f0a2174e870475f45938c29798947234137
Author: Christian Igel <igel at diku.dk>
Date:   Mon Oct 26 13:12:23 2015 +0100

    typo corrected
---
 include/shark/Algorithms/DirectSearch/LMCMA.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/include/shark/Algorithms/DirectSearch/LMCMA.h b/include/shark/Algorithms/DirectSearch/LMCMA.h
index f678a71..7ca25c5 100644
--- a/include/shark/Algorithms/DirectSearch/LMCMA.h
+++ b/include/shark/Algorithms/DirectSearch/LMCMA.h
@@ -44,9 +44,9 @@ namespace detail{
 
 ///\brief Approximates a Limited Memory Cholesky Matrix from a stream of samples.
 ///
-/// GIven a set of points \f$ v_i\f$, produces an approximation of the cholesky factor of a matrix:
+/// Given a set of points \f$ v_i\f$, produces an approximation of the cholesky factor of a matrix:
 /// \f[ AA^T=C= (1-\alpha) C^{t-1} + \alpha* x_{j_t} x_{j_t}^T \f]
-/// here the \f j_t \f$ are chosen such to have an approximate distance \f$ N_{steps} \f$. It is assumed
+/// here the \f$ j_t \f$ are chosen such to have an approximate distance \f$ N_{steps} \f$. It is assumed
 /// that the \f$x_i \f$ are correlated and thus a big \f$ N_{steps} \f$ tris to get points which are less 
 /// correlated. The matrix keeps a set of vectors and decides at every step which is will discard.
 ///

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/shark.git