deletions | additions       diff --git a/experiments.tex b/experiments.tex  index b9e114a..11ce5e2 100644  --- a/experiments.tex  +++ b/experiments.tex 
...
For both tasks, the parameters for the algorithms were selected using cross-validation. In the case of the SVM, the search space was on logarithmic scale from $10^{-2}$ to $10^4$ for the regularization parameter. In the case of the random forest, the number of trees used ranged from 50 to 300 in steps of 50, the maximum depth of each tree varied from 10 to 100, in steps of 50, and the measure of the quality of the split was either the Gini impurity measure or the information gain.   Table X \ref{table:recog_values}  contains the average, maximum and minimum values obtained for the accuracy of the character recognition problem. % Please add the following required packages to your document preamble:  % \usepackage{booktabs}  \begin{table}[h]  \caption{My caption}  \label{my-label} \caption{The errors for the character recognition experiment}  \label{table:recog_values}  \begin{tabular}{lllll}  \hline  Regularization & Min & Max & Mean & Std. dev. \\ \hline