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 13 of 13 for “"Efficient Data Structures"”.
-
Efficient data structures for information retrieval
This dissertation 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 …
-
Efficient data structures for piecewise-smooth video processing
… functions computed from the input data. In this thesis, we present two computationally efficient data structures for representing piecewise-smooth visual information and demonstrate how they can dramatically simplify and accelerate a variety of video processing algorithms. We start …
-
Efficient data structures for distributed and mobile geometry processing
3D geometry data is now establishing as a new digital multimedia data type after text and sound in 1980' and images and video in 1990'. One of the major advantages of 3D data is that it enables users to actually interact with the displayed contents, which has embraced more and enhanced interactive …
-
Topics in Combinatorial Algorithms
… The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms and data structures.
-
GreenC5: An Adaptive, Energy-Aware Collection for Green Software Development
<p>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 …
-
Automatic Test Generation Techniques for Sequential Circuits
… circuits. A simple GA, which interacts with an efficient diagnostic fault simulator, is proposed to target groups of undistinguished fault pairs iteratively. Efficient data structures are used and heuristics are proposed to seed the initial populations of the GA. Experimental results also …
-
Making Data Meaningful: Stakeholder Perceptions on Data Visualization and Data Management Practices Within a Multi-Tiered System of Supports (MTSS)
<p>Data-driven decision-making and collaboration are core pillars of a multi-tiered system of supports (MTSS); however, timely and accessible data use, as well as data literacy and visualization literacy skills, are challenges school leaders and educators face related to implementing such …
-
Randomized Data Structures: New Perspectives and Hidden Surprises
… most basic questions in the theory of randomized data structures—questions such as: How efficient is a linear probing hash table? How fast can you maintain a sorted array of numbers? How big does a pointer have to be? With the help of new techniques, along with a willingness to look beyond …
-
In search of better proximity
… when proximity search is easy, i.e., there is a data-structure requiring near-linear space and allowing logarithmic query time. We study three problems: (i) Answering nearest-neighbor queries in a metric space when the query is restricted to a subspace of low doubling dimension. We show that even …
-
A sonar-based mapping system for an unmanned undersea vehicle
… capabilities, the building and updating of an efficient and accurate map of the tactical scene is critical. The challenges are to obtain useful and comprehensive information about the environment, to represent and fuse this data into an on-board map, to update the map in real-time when new data …
-
Alignments and beyond: A versatile swarm-based framework for de novo amplicon clustering
… sequencing and the resulting massive amplicon data sets have become an essential element of research in the life sciences. While they provide the basis for new insights in various disciplines, the continuously increasing size of the data sets challenges the involved bioinformatics pipelines. …
-
Three-valued abstraction for stochastic systems
… have been proposed, ranging from the use of efficient data structures to a number of reduction techniques. This thesis is concerned with abstraction, that is, with the reduction of available information in the system’s model, and the question of what properties are preserved when applying …
-
Efficient visual navigation of hierarchically structured graphs
… First and foremost, there is need for an efficient data structure for this graph view maintenance problem. Depending on the admissible modifications of the graph and its hierarchical clustering, three variants have been discussed in the literature: in the static case, everything is fixed; …