qlq coquilles (mais j'ai plus regardé le fond)

[canny.git] / stc.tex

diff --git a/stc.tex b/stc.tex
index 7ce100b8be84e7d3623b727a49ae7755b84b6e4f..16fbfb3c09c234966ebed5975e7b8ccc12232742 100644 (file)
--- a/stc.tex
+++ b/stc.tex
@@ -63,7 +63,7 @@ that minimizes $D_X(x,y)$ has exponential complexity with respect to $n$.
 The Syndrome-Trellis Codes  (STC) 
 presented by Filler et al. in~\cite{DBLP:conf/mediaforensics/FillerJF10} 
 is a practical solution to this complexity. Thanks to this contribution,
 The Syndrome-Trellis Codes  (STC) 
 presented by Filler 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 resspect to $n$.
+the solving algorithm has a linear complexity with respect to $n$.

 
 First of all, Filler et al. compute the matrix $H$
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next
 
 First of all, Filler et al. compute the matrix $H$
 by placing a small sub-matrix $\hat{H}$ of size $h × w$ next