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 18 of 18 for “"Graph exploration"”.

  1. Collaborative graph exploration

    This thesis discusses the exploration of a landscape by a team of robots. The landscape is for that purpose modeled by a graph, along whose edges robots may travel in a round-based model with the goal to visit all vertices of the graph. For this purpose an algorithm chooses for each robot in each …

    freiburg-diss Repository record for Collaborative graph exploration (opens in a new tab)

  2. Ergodic Graph Exploration via Markov Chain for Active Robotic Information Acquisition

    Many robotic applications can be considered as information acquisition, including surveillance,environmental monitoring, disaster response, and robotic learning. These tasks are often a combination of being repetitive, time consuming, time sensitive, or dangerous, which are unsuitable for human to …

    washington Repository record for Ergodic Graph Exploration via Markov Chain for Active Robotic Information Acquisition (opens in a new tab)

  3. Black Hole Search in the Network and Subway Models

    … agents to work together to map or explore a graph-like network environment where some elements of the network are dangerous to the agents. Most research into black hole search has focussed on finding a single dangerous node: a black hole. We look at the problem of finding multiple black holes …

    ottawa-retro Repository record for Black Hole Search in the Network and Subway Models (opens in a new tab)

  4. Exploring Temporal Cycles and Grids

    A temporal graph is a graph in which the edge set can change from time to time. The temporal graph exploration problem, TEXP, is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and …

    concordia Download PDF for Exploring Temporal Cycles and Grids (opens in a new tab)

  5. Adaptive visual network analytics: Algorithms, interfaces, and systems for exploration and querying

    Large graphs are now commonplace, amplifying the fundamental challenges of exploring, navigating, and understanding massive data. Our work tackles critical aspects of graph sensemaking, to create human-in-the-loop network exploration tools. This dissertation is comprised of three research thrusts, …

    gatech Repository record for Adaptive visual network analytics: Algorithms, interfaces, and systems for exploration and querying (opens in a new tab)

  6. Intelligent Support for Exploration of Data Graphs

    … research investigates how to support a user’s exploration through data graphs generated from semantic databases in a way leading to expanding the user’s domain knowledge. To be effective, approaches to facilitate exploration of data graphs should take into account the utility from a user’s …

    whiterose Download PDF for Intelligent Support for Exploration of Data Graphs (opens in a new tab)

  7. Goal-directed dynamics of network topology

    … human curiosity as the goal-directed exploration of networked knowledge spaces. We treat knowledge as a dynamic subgraph induced by acquired units of information and use this characterization to study theoretical accounts of the motivations underlying human curiosity. Chapter 4 …

    penn Repository record for Goal-directed dynamics of network topology (opens in a new tab)

  8. Massively parallel algorithms for sparse graphs

    Most real-life graphs are large and sparse, consisting of billions of nodes connected by billions of edges. Single-machine computation for such graphs is often slow and inefficient. The modern approach is to deploy a fleet of machines that work on a given graph problem in parallel. The Massively …

    aalto Repository record for Massively parallel algorithms for sparse graphs (opens in a new tab)

  9. Interactive graph layout: The exploration of large graphs.

    Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach …

    arizona-thes Repository record for Interactive graph layout: The exploration of large graphs. (opens in a new tab)

  10. Large graph visualization and interaction for collocated collaboration

    … Many experts fields deal with multivariate graphs; that is, graphs with multivariate data associated with their nodes. Furthermore, many experts work in close collaborative environments. This dissertation explores information visualization and tabletop interaction to address both these …

    adelaide Repository record for Large graph visualization and interaction for collocated collaboration (opens in a new tab)

  11. Universality of path algebra for recommendation problems

    … that recommendations can be abstracted as a graph exploration problem and we describe a graph­-theoretic framework with two primary parts: (a) a recommendation graph to model all the elements of an (application) domain from a recommendation perspective, including the subjects of …

    greece Repository record for Universality of path algebra for recommendation problems (opens in a new tab)

  12. Hybrid visualizations for data exploration

    Information Visualization (Infovis) graphically encodes information to help a user explore a data set visually and interactively. This graphical encoding can take the form of widespread visualizations such as bar charts and scatterplots. Multiple visualizations can share the same functional space …

    ets-quebec Download PDF for Hybrid visualizations for data exploration (opens in a new tab)

  13. A Scalable P2P RIA Crawling System with Fault Tolerance

    … for storing only a portion of the RIA graph. This makes the distributed data structure invulnerable to a single point of failure. However, accessing the distributed data required by crawlers makes the crawling task challenging when the number of crawlers becomes high. We show by …

    ottawa-retro Repository record for A Scalable P2P RIA Crawling System with Fault Tolerance (opens in a new tab)

  14. Graph mining In complex networks and prediction in the web graph

    … for their investigation gave prominence to the Graph Mining field which constitutes a very powerful tool of data representation (as graphs). Graphs have become very important in modeling complicated structures and analyzing the topological characteristics of large and complex networks and …

    greece Repository record for Graph mining In complex networks and prediction in the web graph (opens in a new tab)

  15. ASSISTIVE TECHNOLOGIES ON MOBILE DEVICES FOR PEOPLE WITH VISUAL IMPAIRMENTS

    … comprehension and memorization. Abstract space exploration in the field of assistive didactics is tackled through tactile exploration and audio feedback resulting in two solutions. The first one focuses on math learning in primary education while the second one focuses on function graph tactile …

    milano Repository record for ASSISTIVE TECHNOLOGIES ON MOBILE DEVICES FOR PEOPLE WITH VISUAL IMPAIRMENTS (opens in a new tab)

  16. Revealing evolutionary patterns in dynamic graphs: exploration and visualization techniques

    Graphs are a fundamental data structure used to model a wide range of complex systems, such as social networks, biological processes, and transportation systems. These graphs are often dynamic, evolving over time with changes in both their structure and attributes. This introduces significant …

    greece Repository record for Revealing evolutionary patterns in dynamic graphs: exploration and visualization techniques (opens in a new tab)