aboutsummaryrefslogtreecommitdiff
path: root/report
diff options
context:
space:
mode:
Diffstat (limited to 'report')
-rw-r--r--report/paper.md11
-rw-r--r--report/template.latex1
2 files changed, 6 insertions, 6 deletions
diff --git a/report/paper.md b/report/paper.md
index 7c57df9..6ebf32d 100644
--- a/report/paper.md
+++ b/report/paper.md
@@ -268,23 +268,22 @@ Figure \ref{fig:rerank} shows successful re-ranking as performed using the query
# Conclusions
+Overall the re-ranking method gives a significant improvement to both top $k$ accuracy and mean average precision.
+The cost of this operation is an increase in computation time due to the change in complexity from
+the baseline, summarized in the table.
-\begin{table}[]
+\begin{table}[H]
\centering
\begin{tabular}{ll}
\hline
\textbf{Process} & \textbf{Complexity} \\ \hline
Euclidean Distance Calculatoin & \textit{O(N\textsuperscript{2})} \\
-Mahalanobis Distance Calculatoin & \textit{O(N\textsuperscript{3 (2.708)})} \\
+Mahalanobis Distance Calculatoin & \textit{O(N\textsuperscript{3 (opt:2.708)})} \\
Re-ranking with Jaccard & \textit{O(N\textsuperscript{2}logN)} \\ \hline
\end{tabular}
\label{tab:complexity}
\end{table}
-Overall the re-ranking method gives a significant improvement to both top $k$ accuracy and mean average precision.
-The cost of this operation is an increase in computation time due to the change in complexity from
-the baseline, summarized in the table.
-
# References
diff --git a/report/template.latex b/report/template.latex
index 9917236..d459163 100644
--- a/report/template.latex
+++ b/report/template.latex
@@ -7,6 +7,7 @@ $if(fontfamily)$
$else$
\usepackage{lmodern}
$endif$
+\usepackage{float}
$if(linestretch)$
\usepackage{setspace}
\setstretch{$linestretch$}