leo/cours-m1-eea
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

cours du 18/02

Browse source
This commit is contained in:
Pierre-antoine Comby 2019-02-22 10:49:25 +01:00
parent 99c80b014d
commit c1ac4b347e
1 changed files with 4 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
455-Codage_Sources/Cours/chap2.tex
View file

@ -257,6 +257,10 @@ Les conditions nécessaires pour avoir $D$ minimale sont :
& \Leftrightarrow b_i = \frac{y_i+y_{i+1}}{2}, \quad i=1 \dots M-1 & \Leftrightarrow b_i = \frac{y_i+y_{i+1}}{2}, \quad i=1 \dots M-1
\end{align*} \end{align*}
\subsection{Quantification non uniforme}
\newpage \newpage
\subsection*{Algorithme de Lloyd -Max} \subsection*{Algorithme de Lloyd -Max}
\begin{enumerate} \begin{enumerate}