Avancées dans la conclusion

[canny.git] / stc.tex

diff --git a/stc.tex b/stc.tex
index e98589facf56445e0f8a40c6ffa0399863a1e3b1..a5442786bbf0d41848c477d8bae9d75756763ea4 100644 (file)
--- a/stc.tex
+++ b/stc.tex
@@ -65,7 +65,7 @@ presented by Filler \emph{et al.} in~\cite{DBLP:conf/mediaforensics/FillerJF10}
 is a practical solution to this complexity. Thanks to this contribution,
 the solving algorithm has a linear complexity with respect to $n$.
 
 is a practical solution to this complexity. Thanks to this contribution,
 the solving algorithm has a linear complexity with respect to $n$.
 

-First of all, Filler et al. compute the matrix $H$
+First of all, Filler \emph{et al.} compute the matrix $H$

 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
 to each other and shifted down by one row. 
 Thanks to this special form of $H$, one can represent
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
 to each other and shifted down by one row. 
 Thanks to this special form of $H$, one can represent