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 40 for “"Graph theory--Data processing"”.

  1. Automatic compression for image sets using a graph theoretical framework

    … set. This scheme is obtained using a unified graph-theoretical framework that allows for compression strategies to be compared both theoretically and experimentally. This strategy achieves optimal lossless compression by computing a minimum spanning tree of a graph constructed from the image …

    lethbridge Repository record for Automatic compression for image sets using a graph theoretical framework (opens in a new tab)

  2. Mining Quasi-Frequent Subnetworks in Graph Networks Using Edge-Edge Summary Graph

    In today’s computing world, graphs have become increasingly important in modeling sophisticated structures, entities and their interactions, with broad applications including Bioinformatics, Computer Vision, Web analysis etc. For an example, multiple gene expressions samples over the same set of …

    ndsu Repository record for Mining Quasi-Frequent Subnetworks in Graph Networks Using Edge-Edge Summary Graph (opens in a new tab)

  3. Visualizing three-dimensional graph drawings

    … GLuskap system for interactive three-dimensional graph drawing applies techniques of scientific visualization and interactive systems to the construction, display, and analysis of graph drawings. Important features of the system include support for large-screen stereographic 3D display with …

    lethbridge Repository record for Visualizing three-dimensional graph drawings (opens in a new tab)

  4. Using the deep graph representation learning method to study the Indian election social network

    The aim of this dissertation is using the Deep Graph Learning to study on two problems in social network data. This dissertation includes two essays. The first essay is using Deep Graph Representation Learning to solve the counterfactual inference problem on social network. The second essay is …

    msu Repository record for Using the deep graph representation learning method to study the Indian election social network (opens in a new tab)

  5. Two dimensional and three dimensional path planning in robotics

    … convex areas are represented as a nodes in a graph, and a graph traversal strategy that dynamically allocates costs to graph path is used. Modification of the algorithm for small computational time and optimality is discussed. The 3D path planning is done in the three orthogonal …

    portland-state Repository record for Two dimensional and three dimensional path planning in robotics (opens in a new tab)

  6. Algorithms for discrete geometric and graph theoretic pursuit problems

    Includes bibliographical references (pages 101-104).

    colo-mines Repository record for Algorithms for discrete geometric and graph theoretic pursuit problems (opens in a new tab)

  7. Quadtree-based processing of digital images

    … representation plays an important role in image processing applications, which usually. contain a huge amount of data. An image is a two-dimensional array of points, and each point contains information (eg: color). A 1024 by 1024 pixel image occupies 1 mega byte of space in the main memory. In …

    portland-state Repository record for Quadtree-based processing of digital images (opens in a new tab)

  8. Implementing Dijkstra's pathfind using quantum algorithms

    This thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  9. Implementing Dijkstra's pathfind using quantum algorithms

    This thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

    csusb-retro Repository record for Implementing Dijkstra's pathfind using quantum algorithms (opens in a new tab)

  10. A high-performance framework for analyzing massive complex networks

    Graphs are a fundamental and widely-used abstraction for representing data. We can analytically study interesting aspects of real-world complex systems such as the Internet, social systems, transportation networks, and biological interaction data by modeling them as graphs. Graph-theoretic and …

    gatech Repository record for A high-performance framework for analyzing massive complex networks (opens in a new tab)

  11. Graph Data Conversion and Tree Visualization

    The first part of the paper is converting graph data format from GXL to GraphML. GXL and GraphML are both XML-based languages for representing graph data. The HP page segmentation tool produces output graph data in GXL format, and the Visual Environment for Graph Grammar Induction and Engineering …

    ndsu Repository record for Graph Data Conversion and Tree Visualization (opens in a new tab)

  12. Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data

    This thesis presents a new metric named Graph Distributional Analytics (GDA). This approach uses Weisfeiler-Leman kernels, cosine similarity, and traditional statistical metrics to better characterize graph-structured data. It focuses on enhancing the analysis of graph-structured data and enhancing …

    umkc Repository record for Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data (opens in a new tab)

  13. Dynamic consensus networks: spectral properties, consensus, and control

    … networks. We transform each concept of static graph theory into dynamic terms, out of which a generalized dynamic graph theory naturally emerges. Three different types of dynamic consensus networks are addressed based on node dynamics and network topology. We investigate stability and consensus …

    colo-mines Repository record for Dynamic consensus networks: spectral properties, consensus, and control (opens in a new tab)

  14. Distributed Algorithms and Inverse Graph Filtering

    Graph signal processing provides an innovative framework to handle data residing on distributed networks, smart grids, neural networks, social networks and many other irregular domains. By leveraging applied harmonic analysis and graph spectral theory, graph signal processing has been extensively …

    ucf Repository record for Distributed Algorithms and Inverse Graph Filtering (opens in a new tab)

  15. Two new parallel processors for real time classification of 3-D moving objects and quad tree generation

    Two related image processing problems are addressed in this thesis. First, the problem of identification of 3-D objects in real time is explored. An algorithm to solve this problem and a hardware system for parallel implementation of this algorithm are proposed. The classification scheme is based …

    portland-state Repository record for Two new parallel processors for real time classification of 3-D moving objects and quad tree generation (opens in a new tab)

  16. Graph Neural Networks for Improved Interpretability and Efficiency

    Attributed graph is a powerful tool to model real-life systems which exist in many domains such as social science, biology, e-commerce, etc. The behaviors of those systems are mostly defined by or dependent on their corresponding network structures. Graph analysis has become an important line of …

    ucf Repository record for Graph Neural Networks for Improved Interpretability and Efficiency (opens in a new tab)

Page 1 of 2