diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-22 14:34:30 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2025-05-22 14:34:30 -0400 |
| commit | d49867867cf950a85cabcbcbaf43bb762c9912ac (patch) | |
| tree | b124735346cbf75185d65df3704285ac2e742541 /chapters/beyond-dsp.tex | |
| parent | ae552423e36a12a458a1719a6607998ccf129a38 (diff) | |
| download | dissertation-d49867867cf950a85cabcbcbaf43bb762c9912ac.tar.gz | |
updates
Diffstat (limited to 'chapters/beyond-dsp.tex')
| -rw-r--r-- | chapters/beyond-dsp.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/chapters/beyond-dsp.tex b/chapters/beyond-dsp.tex index 38a99c5..87f44ba 100644 --- a/chapters/beyond-dsp.tex +++ b/chapters/beyond-dsp.tex @@ -1353,7 +1353,7 @@ structures. Specifically, \subsection{Design Space Evaluation} - +\label{ssec:dyn-ds-exp} \begin{figure} %\vspace{0pt} \centering @@ -1519,7 +1519,7 @@ in this case, doesn't add a significant amount of overhead over a single instance of the static structure. \subsection{$k$-NN Search} - +\label{ssec:dyn-knn-exp} Next, we'll consider answering high dimensional exact $k$-NN queries using a static Vantage Point Tree (VPTree)~\cite{vptree}. This is a binary search tree with internal nodes that partition records based |