Merge branch 'master' of ssh://vo20.nl/home/git/repos/uva

improc/ass4/report/report.tex

@@ -135,9 +135,9 @@ G = convolve(F, Gauss(s), mode='nearest')
 \end{verbatim}
 
 The timing results of the first code snippet are displayed in figure
-\ref{fig:times-1d}. The graphs shows that \texttt{Gauss1} has a computational
-complexity of $\mathcal{O}(\sigma)$, which is much faster than the 2D
-convolution (certainly for higher scales).
+\ref{fig:times-1d}. The graphs shows that the 1D convolution has a
+computational complexity of $\mathcal{O}(\sigma)$, which is much faster than
+the 2D convolution (certainly for higher scales).
 
 \begin{figure}[H]
 	\label{fig:times-1d}