X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/canny.git/blobdiff_plain/f9feb4cb5a39609ffdf39b086e8d796592a71da5..c3438d8c47f3989f6d0d0e6109a3c216cca0d7c7:/stc.tex?ds=sidebyside

diff --git a/stc.tex b/stc.tex
index e98589f..a544278 100644
--- 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$.
 
-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
