Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 24 for “"dynamic data structures"”.
-
Dynamic Data Structures for Two Dimensional Searching
In this thesis we investigate dynamic data structures and algorithms for searching in a subdivision of the plane. Three specific problems have been addressed in this area. The first problem, dynamic point location, considers a geometric subdivision of the plane into polygonal regions, and asks for …
-
Dynamic Data Structures for Geometric Search and Retrieval
Data structures for geometric search and retrieval are of significant interest in areas such as computational geometry, computer graphics, and computer vision. The focus of this dissertation is on the design of efficient dynamic data structures for use in approximate retrieval problems in …
-
GreenC5: An Adaptive, Energy-Aware Collection for Green Software Development
Dynamic data structures in software applications have been shown to have a large impact on system performance. In this paper, we explore energy saving opportunities of interface-based dynamic data structures. Our results suggest that savings opportunities exist in the C5 Collection between 16.95% …
-
Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems
… solution accuracy. Implementations with static data structures often fail in practice because of unpredictable memory requirements. This is especially critical in S⁴W (Site-Specific System Simulator for Wireless communication systems), where the DIRECT optimization is just one small component …
-
Efficient data structures for information retrieval
… deals with the application of efficient data structures and hashing algorithms to the problems of textual information storage and retrieval. We have developed static and dynamic techniques for handling large dictionaries, inverted lists, and optimizations applied to ranking algorithms. We …
-
Geometric set cover and related geometric optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms
-
Hinted Data Structures with Applications to Optimization and Learning
This thesis investigates the interplay among data structures, graph algorithms, and machine learning, providing a fresh lens on conventional perspectives concerning worst-case scenarios and data structure performance. The thesis is divided into two main parts. The first part delves into the concept …
-
Improving the Robustness of Artificial Neural Networks via Bayesian Approaches
… denoising methods are not efficient on dynamic data structures; and mechanism designing methods often depend on heuristic explorations. Detection-based methods devote to identifying novel or anomaly instances for further downstream tasks. Nonetheless, such instances may belong to …
-
Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT
… an efficient, portable, and robust design of a data-distributed massively parallel DIRECT, the deterministic global optimization algorithm widely used in multidisciplinary engineering design, biological science, and physical science applications. The original algorithm is modified to adapt to …
-
Three Approaches to Building Time-Windowed Geometric Data Structures
… search range trees. Our third approach is to use dynamic data structures directly, taking advantage of a new observation that the total number of combinatorial changes to a planar convex hull is near linear for any FIFO update sequence, in which deletions occur in the same order as insertions.
-
A Study of Client-based Caching for Parallel I/O
… associated with accessing parallel file system data. In this dissertation we demonstrate how client-side file data caching can improve parallel file system throughput for applications performing frequent small and unaligned file I/O. We explore the impacts of cache page size and cache capacity …
-
The STAPL pList
… stapl provides a collection of distributed data structures (pContainers) and parallel algorithms (pAlgorithms) and a generic methodology for extending them to provide customized functionality. stapl pContainers are thread-safe, concurrent objects, providing appropriate interfaces (pViews) …
-
Development of Finite Element Modeling Mesh Generation and Analysis Software for Light Wood Frame Houses
… program relies on the use of STL as it provides dynamic data structures, algorithms for storage, searching, sorting, etc. Efficiency of the program is improved by the use of the in-built features in STL instead of developing new code. Analysis of the finite element models generated by the …
-
3D Scene Reconstruction with Micro-Aerial Vehicles and Mobile Devices
… geometric model of one's environment from sensor data. We explore the problem of real-time, large-scale 3D scene reconstruction in indoor environments using small laser range-finders and low-cost RGB-D (color plus depth) cameras. We focus on computationally-constrained platforms such as …
-
From optimization to listing: theoretical advances in some enumeration problems
… of [Tsukiyama et al., 1980] and relying on some dynamic data structures by [Holm et al., 2001], it is possible to define an eO(n)-delay algorithm to output each bond of the graph as a bipartition of the n vertices. Disregarding the polylogarithmic factors hidden in the eO notation, this is the …
-
Knihovna pro vizualizaci dynamických datových struktur
… návrhem a implementací knihovny pro vizualizaci dynamických datových struktur ve formě orientovaných grafů. Zaměřuje se také na chyby, které při implementaci těchto struktur můžou vzniknout. Výsledná knihovna může být použita jako ladicí nástroj nebo pro výuku algoritmů pro práci s těmito …
-
Memory Footprint Reduction of Operating System Kernels
… degradation in performance. Last, we describe dynamic data structure compression, an approach that reduces the runtime memory footprint of dynamic data structures in an OS kernel. A prototype implementation for the Linux kernel reduces the memory consumption of the slab allocators in Linux by …
-
Ανάπτυξη μεθοδολογίας για την βελτιστοποίηση τύπων δεδομένων δυναμικών εφαρμογών σε ενσωματωμένα συστήματα
… users demand more and more complex and dynamic applications. Cases like voice transmission VoIP, high definition video rendering, internet browsing and 3D applications share as common characteristic the increased need in data storage and access. In order to provide a flowing performance …
-
Discovering heap anomalies in the wild
… leverage the managed runtime to perform dynamic heap analysis. Previous heap analysis approaches significantly slow down programs, require special hardware, and/or increase memory consumption by 75% or more. We presents two synergistic techniques—dynamic object sampling (DOS) and heap …
-
Predicting multibody assembly of proteins
… function which includes both a statistical thermodynamic approximation of molecular free energy as well as several of knowledge-based terms. Parameters of the scoring model were learned based on a large set of positive/negative examples, and when tested on 176 protein complexes of various types, …
Page 1 of 2