diff options
| -rw-r--r-- | chapters/dynamization.tex | 8 | ||||
| -rw-r--r-- | img/design-space/isam-tput.pdf | bin | 16059 -> 18185 bytes | |||
| -rw-r--r-- | img/design-space/knn-parm-sweep.pdf | bin | 10237 -> 10797 bytes | |||
| -rw-r--r-- | img/design-space/vptree-tput.pdf | bin | 15790 -> 17857 bytes |
4 files changed, 0 insertions, 8 deletions
diff --git a/chapters/dynamization.tex b/chapters/dynamization.tex index db60d2e..a2277c3 100644 --- a/chapters/dynamization.tex +++ b/chapters/dynamization.tex @@ -1216,14 +1216,6 @@ showed how amortized global reconstruction can be used to dynamize data structures associated with search problems having certain properties. We examined several theoretical approaches for dynamization, including the equal block method, the Bentley-Saxe method, and a worst-case insertion -@manual{nxp:tja1043, - organization = "NXP Semiconductors", - title = "High-speed CAN transceiver", - number = "TJA1043", - year = 2013, - month = 4, - note = "Rev. 3" -} optimized approach. Additionally, we considered several more classes of search problem, and saw how additional properties could be used to enable more efficient reconstruction, and support for efficiently deleting diff --git a/img/design-space/isam-tput.pdf b/img/design-space/isam-tput.pdf Binary files differindex 7677911..c6c5064 100644 --- a/img/design-space/isam-tput.pdf +++ b/img/design-space/isam-tput.pdf diff --git a/img/design-space/knn-parm-sweep.pdf b/img/design-space/knn-parm-sweep.pdf Binary files differindex c6243f8..a865849 100644 --- a/img/design-space/knn-parm-sweep.pdf +++ b/img/design-space/knn-parm-sweep.pdf diff --git a/img/design-space/vptree-tput.pdf b/img/design-space/vptree-tput.pdf Binary files differindex adf3937..481f59d 100644 --- a/img/design-space/vptree-tput.pdf +++ b/img/design-space/vptree-tput.pdf |