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 430 for “"data structures"”.
-
Smart data structures : an online machine learning approach to multicore data structures
… collaboration among threads through shared data structures. Unfortunately, choosing and hand-tuning data structure algorithms to get good performance across a variety of machines and inputs is a herculean task to add to the fundamental difficulty of getting a parallel program correct. To …
-
Data Structures for Points-To Analysis
In this dissertation, we present improvements to data structures, and the algorithms upon them, for points-to analysis. Our focus is mainly on flow-sensitive analysis but our techniques can either be applied to other analyses or used in analyses which combine flow-sensitivity with other …
-
Logical Data Structures for Spatial Analysis
Computer readable data have become increasingly difficult to use and integrate in research because of expanding physical file sizes, increasing thematic diversity with concomitant shifts in levels of aggregation and measurement, and a general lack of uniformity and compatibility among data …
-
Displaying data structures for interactive debugging
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1980.
-
Lower bound techniques for data structures
… new techniques for proving lower bounds on data-structure problems, with the following broad consequences: * the first [omega](lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; * for static data structures, the first separation between linear …
-
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 …
-
Designing Compact On-Disk Index Data Structures
The performance of a database system heavily depends on its storage engine. The design of on-disk index data structure is critical to the storage engine performance. Many database systems have chosen B+-trees as the on-disk index data structure. A B+-tree organizes every internal node in a block of …
-
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 …
-
Improved authenticated data structures for blockchain synchronization
DSpace SAF Submission Ingestion Package generated from Vireo submission #12843 on 2018-09-27 at 10:47:57
-
Instance-Optimized Data Structures for Membership Queries
… and hardware growth has hit a stagnation. Modern data processing systems need to continuously improve their performance to match the humongous growth of data. Data structures and algorithms such as sorting, indexes, filters, hash tables, query optimization, etc are the fundamental building blocks …
-
Designing, Modeling, and Optimizing Transactional Data Structures
… TM can be leveraged to implement transactional data structures (i.e., those where multiple operations are allowed to execute atomically, all-or-nothing, according to the transaction paradigm), its intensive speculation may result in significantly lower performance than the optimized concurrent …
-
Performance Evaluation of Competing Data Structures in Pathfinding
… path problem. The A* algorithm utilizes two data structures. A* explores the nodes in the graph from the start position one by one and assign them a value of F which is the sum of G cost and H cost. G Cost is the actual cost of exploring the node from the starting position to the current …
-
Non-Blocking Data Structures Handling Multiple Changes Atomically
… that can apply multiple changes to a shared data structure atomically using Compare&Swap (CAS) instructions. We applied our approach to two data structures, doubly-linked lists and Patricia tries. In our implementations, only update operations perform CAS instructions; operations other than …
-
Data Structures and Algorithms for Scalable NDN Forwarding
<p>Named Data Networking (NDN) is a recently proposed general-purpose network architecture that aims to address the limitations of the Internet Protocol (IP), while maintaining its strengths. NDN takes an information-centric approach, focusing on named data rather than computer addresses. In NDN, …
-
Data structures, minimization and complexity of boolean functions
… special Boolean functions. Moreover, some new data structures for Boolean functions are reported in this thesis. Some functions are found to have constant complexity in the new data structure while having exponential complexity in existing data structures.
-
Coherence in natural language : data structures and applications
… approaches best predict the human data. However, coherence-based algorithms that operate on trees did not perform as well as coherence-based algorithms that operate on more general graphs. It is suggested that that might in part be due to the fact that more general graphs are more …
-
Models and data structures for digital logic simulation.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1966. E.E.
-
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 …
Page 1 of 22