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 6 of 6 for “"data structure and algorithm"”.

  1. Rapidly-exploring Random Tree Inspired Multi-robot Space Coverage

    Inspired by the Rapidly-exploring Random Tree (RRT) data-structure and algorithm for path planning, we introduce an approach for spanning physical space with a group of simple mobile robots. Emphasizing minimalism and using only InfraRed and contact sensors for communication, our position unaware …

    tamu Repository record for Rapidly-exploring Random Tree Inspired Multi-robot Space Coverage (opens in a new tab)

  2. On designing structure-aware high-performance graph algorithms

    Graph algorithms find several usages in industry, science, humanities, and technology. The fast-growing size of graph datasets in the context of the processing model of the current hardware has resulted in different bottlenecks such as memory locality, work-efficiency, and load-balance that degrade …

    qu-belfast Repository record for On designing structure-aware high-performance graph algorithms (opens in a new tab) Download PDF for On designing structure-aware high-performance graph algorithms (opens in a new tab)

  3. Data Structures, Algorithms and Applications for Big Data Analytics: Single, Multiple and All Repeated Patterns Detection in Discrete Sequences

    … focuses on the detection of single, multiple and all repeated patterns in sequences. Many algorithms exist for single pattern detection that take an input argument (i.e., pattern to be detected) and produce as outcome the position(s) where the pattern exists. However, to the best of my …

    calgary Repository record for Data Structures, Algorithms and Applications for Big Data Analytics: Single, Multiple and All Repeated Patterns Detection in Discrete Sequences (opens in a new tab)

  4. Quantum Query Complexity of Hypergraph Search Problems

    … to study the problems of finding triangles and spanning trees in a simple graph. Over the past decades, many techniques are developed for finding the upper and lower quantum query bounds of these graph problems. We can generalize these problems to detecting certain properties of higher rank …

    waterloo Repository record for Quantum Query Complexity of Hypergraph Search Problems (opens in a new tab)

  5. Efficient Algorithms to Compute Hierarchical Summaries from Big Data Streams

    Many data stream applications have hierarchical data; containing time, geographic locations, product information, clickstreams, server logs, IP addresses. A hierarchical summary of such volumous data offers multiple advantages including compactness, quick understanding, and abstraction. The goal of …

    unsw Repository record for Efficient Algorithms to Compute Hierarchical Summaries from Big Data Streams (opens in a new tab)

  6. Distributed management of competitive access to common resources using algorithmic game theory

    … inextricable part of daily personal, educational and business activity, turning any problems in its operation or availability into a significant interruption of these activities and their users. The resources offered by the Internet (capacity, coverage) are continuously increasing but at the same …

    greece Repository record for Distributed management of competitive access to common resources using algorithmic game theory (opens in a new tab)