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 98 for “"data structures and algorithms"”.

  1. Data structures and algorithms for supporting GLAD interfaces.

    The relational database model has become the most popular and widespread database model. Most current database systems are based upon or related to -he relational model. However, the relational model is beset with significant limitations, pitfalls and deficiencies. The relational model can be …

    nps Repository record for Data structures and algorithms for supporting GLAD interfaces. (opens in a new tab)

  2. Data Structures and Algorithms for Scalable NDN Forwarding

    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, the …

    wustl Repository record for Data Structures and Algorithms for Scalable NDN Forwarding (opens in a new tab)

  3. Disk Intersection Graphs: Models, Data Structures, and Algorithms

    … The unit disk graph UD(P) on P has vertex set P and an edge between two sites p,q of P if and only if p and q have Euclidean distance |pq| <= 1. If we interpret P as centers of disks with diameter 1, then UD(P) is the intersection graph of these disks, i.e., two sites p and q form an edge if and …

    fu-berlin Repository record for Disk Intersection Graphs: Models, Data Structures, and Algorithms (opens in a new tab)

  4. Programming Language for Implementing Data Structures and Algorithms

    Existing programming languages used in Data Structures courses have drawbacks, as they were designed for general-purpose or professional use rather than for education. The goal of this thesis is to design a programming language to be used in a Data Structures course and in which data structures and …

    chalmers Repository record for Programming Language for Implementing Data Structures and Algorithms (opens in a new tab)

  5. Improving sequence analysis with probabilistic data structures and algorithms

    … sequences are not very meaningful by themselves, and useful insights generally come from comparing them to other sequences. Indexing sequences using concepts borrowed from the computational sciences may help perform these comparisons. One such concept is a probabilistic data structure, the Bloom …

    ubc Repository record for Improving sequence analysis with probabilistic data structures and algorithms (opens in a new tab) Download PDF for Improving sequence analysis with probabilistic data structures and algorithms (opens in a new tab)

  6. Category-theoretic data structures and algorithms for learning polynomial circuits

    … in terms of morphisms of these categories and discuss how to generalise gradient-based methods as applied to neural networks to new settings by varying the ‘underlying arithmetic’ of models. Part II of the thesis is concerned with how to represent and manipulate large string diagrams, …

    soton Download PDF for Category-theoretic data structures and algorithms for learning polynomial circuits (opens in a new tab)

  7. Students’ topic-specific difficulties in learning data structures and algorithms

    Data structures and algorithms (DSA) are fundamental concepts in computer science, as they provide basis for e cient computation. An introductory DSA course is mandatory ffi for students in an undergraduate computing curriculum similarly to an introductory programming (IP) course. Investigating …

    aalto Repository record for Students’ topic-specific difficulties in learning data structures and algorithms (opens in a new tab)

  8. Space Efficient Data Structures and Algorithms in the Word-RAM Model

    In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement is an important research topic. One way of reducing storage is using succinct and compact data structures which maintain …

    waterloo Repository record for Space Efficient Data Structures and Algorithms in the Word-RAM Model (opens in a new tab)

  9. Building and Evaluating a Learning Environment for Data Structures and Algorithms Courses

    … it comes to teaching computer science content and concepts, learning technologies have not been heavily used. Perhaps the best known application today is Algorithm Visualization (AV), of which there are hundreds of examples. AVs tend to focus on presenting the procedural aspects of how a given …

    vt Repository record for Building and Evaluating a Learning Environment for Data Structures and Algorithms Courses (opens in a new tab)

  10. Data structures and algorithms for analysis of alternative splicing with RNA- seq data

    … These NGS technologies are still in its infancy and their further development will herald a new era where DNA sequencing is inexpensive and easily manageable. This development has shifted the largest proportion of the workload onto the workbench of the computational biologist that has to cope …

    fu-berlin Repository record for Data structures and algorithms for analysis of alternative splicing with RNA- seq data (opens in a new tab)

  11. Creating an Extendable and Developer-Friendly Framework for Visualizing Data Structures and Algorithms

    The learning of data structures and algorithms is a necessary part of many computer science programs, and visual aids are a good way of enhancing the comprehension of these abstract concepts. In this thesis, we examine how one such visual aid can be made more developer friendly, extendable, and …

    chalmers Repository record for Creating an Extendable and Developer-Friendly Framework for Visualizing Data Structures and Algorithms (opens in a new tab)

  12. Data Structures and Algorithms for Partitioning a Set into Sets of Non-Descending Cardinality

    Data structures have been around since the structured programming era. Algorithms often associate with data structures. An algorithm is a sequence of instructions that accomplishes a task in a finite time period. The algorithm receives zero or more inputs, produces at least one output, consists of …

    umkc Repository record for Data Structures and Algorithms for Partitioning a Set into Sets of Non-Descending Cardinality (opens in a new tab)

  13. Evaluating the Integration of Online, Interactive Tutorials into a Data Structures and Algorithms Course

    … collection of open source tutorials for teaching data structures and algorithms. It was created with the goals of visualizing complex, abstract topics; increasing the amount of practice material available to students; and providing immediate feedback and incremental assessment. In this thesis, I …

    vt Repository record for Evaluating the Integration of Online, Interactive Tutorials into a Data Structures and Algorithms Course (opens in a new tab)

  14. Data structures and algorithms for real-time ray tracing at the University of Texas at Austin

    Modern rendering systems require fast and efficient acceleration structures in order to compute visibility in real time. I present several novel data structures and algorithms for computing visibility with high performance. In particular, I present two algorithms for improving heuristic based …

    texas Repository record for Data structures and algorithms for real-time ray tracing at the University of Texas at Austin (opens in a new tab)

  15. Firewall Policy Diagram: Novel Data Structures and Algorithms for Modeling, Analysis, and Comprehension of Network Firewalls

    Firewalls, network devices, and the access control lists that manage traffic are very important components of modern networking from a security and regulatory perspective. When computers were first connected, they were communicating with trusted peers and nefarious intentions were neither …

    ku Repository record for Firewall Policy Diagram: Novel Data Structures and Algorithms for Modeling, Analysis, and Comprehension of Network Firewalls (opens in a new tab)

  16. Detecting Changes and Finding Collisions in 3D Point Clouds : Data Structures and Algorithms for Post-Processing Large Datasets

    Affordable prices for 3D laser range finders and mature software solutions for registering multiple point clouds in a common coordinate system paved the way for new areas of application for 3D point clouds. Nowadays we see 3D laser scanners being used not only by digital surveying experts but also …

    wurz-thes Repository record for Detecting Changes and Finding Collisions in 3D Point Clouds : Data Structures and Algorithms for Post-Processing Large Datasets (opens in a new tab)

  17. Incorporating LLM-based Interactive Learning Environments in CS Education: Learning Data Structures and Algorithms using the Gurukul platform

    … opportunities to facilitate learning and comprehension. Their application in the classroom, however, is not without challenges. LLMs are prone to hallucination and contextual inaccuracies. Furthermore, they risk exposing learning processes to cheating illicit practices and providing …

    vt Repository record for Incorporating LLM-based Interactive Learning Environments in CS Education: Learning Data Structures and Algorithms using the Gurukul platform (opens in a new tab)

  18. An object-oriented database system for efficient information retrieval applications

    … deals with the application of object-oriented database techniques to the problem of storage and access of information retrieval (IR) data, especially data that can be organized as a graph, such as a thesaurus encoded in semantic networks, or hypertext collections. Even traditional IR models can …

    vt Repository record for An object-oriented database system for efficient information retrieval applications (opens in a new tab)

  19. 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 …

    uiuc Repository record for Dynamic Data Structures for Two Dimensional Searching (opens in a new tab)

Page 1 of 5