From a13116fa67cd0811c8660d38e20500433bb7a3a3 Mon Sep 17 00:00:00 2001
From: jeanpouget-abadie <jean.pougetabadie@gmail.com>
Date: Tue, 19 May 2015 01:15:33 +0200
Subject: fixed typos

---
 paper/sections/appendix.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'paper/sections/appendix.tex')

diff --git a/paper/sections/appendix.tex b/paper/sections/appendix.tex
index 22b87c2..a72114d 100644
--- a/paper/sections/appendix.tex
+++ b/paper/sections/appendix.tex
@@ -159,7 +159,7 @@ convex optimization, the MLE algorithm is faster. This is due to the overhead
 caused by the $\ell_1$-regularisation in~\eqref{eq:pre-mle}.
 
 The dependency of the running time on the number of cascades increases is
-linear, as expected. The slope is largest for our algorithm, which is against
+linear, as expected. The slope is largest for our algorithm, which is again
 caused by the overhead induced by the $\ell_1$-regularization.
 
 
-- 
cgit v1.2.3-70-g09d2

