From f7f1332d3ead7f61e8e1c8a72ade33f3296d2982 Mon Sep 17 00:00:00 2001 From: Douglas Rumbaugh Date: Fri, 6 Jun 2025 15:25:12 -0400 Subject: updates --- chapters/dynamization.tex | 8 -------- img/design-space/isam-tput.pdf | Bin 16059 -> 18185 bytes img/design-space/knn-parm-sweep.pdf | Bin 10237 -> 10797 bytes img/design-space/vptree-tput.pdf | Bin 15790 -> 17857 bytes 4 files changed, 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 index 7677911..c6c5064 100644 Binary files a/img/design-space/isam-tput.pdf and b/img/design-space/isam-tput.pdf differ diff --git a/img/design-space/knn-parm-sweep.pdf b/img/design-space/knn-parm-sweep.pdf index c6243f8..a865849 100644 Binary files a/img/design-space/knn-parm-sweep.pdf and b/img/design-space/knn-parm-sweep.pdf differ diff --git a/img/design-space/vptree-tput.pdf b/img/design-space/vptree-tput.pdf index adf3937..481f59d 100644 Binary files a/img/design-space/vptree-tput.pdf and b/img/design-space/vptree-tput.pdf differ -- cgit v1.2.3