Browsing 2024 UMKC Theses - Freely Available Online by Thesis Department "Computer Science (UMKC)"
Now showing items 1-4 of 4
-
Constant storage for computing shortest paths for a polyhedron
(2024)We present a new scheme for storing shortest path information for a polyhedron. This scheme is obtained by applying the constant storage scheme of Han and Saxena [5] on the outward layout of Sharir and Schorr [10]. We ... -
Searching real numbers in constant time
(2024)This thesis introduces a novel approach for efficient searching of real numbers by integrating Fredman, Komlós and Szemerédi’s sparse table technique [5] with correspondence between real numbers and the integers converted ... -
Time and space tradeoffs in point location
(2024)We preprocess the input subdivision with n points on the plane in O(n√log n) time and store them in O(n/t) space to facilitate point location in O(log t) time, where t is an adjustable parameter. When t is a constant we ... -
Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data
(2024)This thesis presents a new metric named Graph Distributional Analytics (GDA). This approach uses Weisfeiler-Leman kernels, cosine similarity, and traditional statistical metrics to better characterize graph-structured data. ...