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 15 of 15 for “"GRAPH PARTITION"”.

  1. GPU-accelerated solutions for higher-order assignment and graph partition problems

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2025-05-01

    uiuc Repository record for GPU-accelerated solutions for higher-order assignment and graph partition problems (opens in a new tab)

  2. Modular decomposition of undirected graphs

    Graphs found in nature tend to have structure and interesting compositions that allow for compression of the information and thoughtful analysis of the relationships between vertices. Modular decomposition has been studied since 1967 [1]. Modular decomposition breaks a graph down into smaller …

    colostate Repository record for Modular decomposition of undirected graphs (opens in a new tab)

  3. VHDL simulation of the implementation of a costfunction circuit

    … system design. A cost function calculation in a graph partition algorithm is used here as an example to test the VHDL design methodology. Subroutines or statements in the software can be implemented into hardware if the subroutines or the statements in that software are suitably grouped. While …

    nps Repository record for VHDL simulation of the implementation of a costfunction circuit (opens in a new tab)

  4. Sequencing geographical data for efficient query processing on air in mobile computing.

    … are broadcast in two separate channels. Hypergraph representations are used to represent the spatial relationships of both point data and graph data. The broadcast data placement problem is then converted to the graph layout problem. A framework for classifying ordering heuristics for …

    oklahoma-thes Repository record for Sequencing geographical data for efficient query processing on air in mobile computing. (opens in a new tab)

  5. Distributed quantum computing via enhanced connectivity

    … (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in …

    temple Repository record for Distributed quantum computing via enhanced connectivity (opens in a new tab)

  6. Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations

    … with optimizing extremal eigenvalues of weighted graph Laplacian matrices. In general, the Laplacian matrix of a (weighted) graph is of particular importance in spectral graph theory and combinatorial optimization (e.g., graph partition like max-cut and graph bipartition). Especially the …

    qucosa-diss

  7. Graph Learning for Urban Computing: Techniques and Applications

    … feasible in practice. This dissertation develops graph learning frameworks for four urban computing tasks: sensor recovery, spatial generation, service boundary redesign, and infrastructure expansion. The first two are state-oriented, inferring or generating urban conditions within graph-based …

    vt Repository record for Graph Learning for Urban Computing: Techniques and Applications (opens in a new tab)

  8. A Partitioning Approach for Parallel Simulation of AC-Radial Shipboard Power Systems

    … an SPS. The program first represents an SPS as a graph, and then partitions the graph. Each graph partition represents a SPS subsystem and is computationally balanced using iterative refinement heuristics. Once balanced subsystems are obtained, each SPS subsystem's electrical network equations are …

    tamu Repository record for A Partitioning Approach for Parallel Simulation of AC-Radial Shipboard Power Systems (opens in a new tab)

  9. Towards Structural Stability of Social Networks

    … both the network holders and the participants. Graphs are widely used to model social networks, where the coreness of a vertex (node) has been validated as the "best practice" for capturing a user's engagement. Based on this argument, we study the following problems: 1) reinforcing the network …

    unsw Repository record for Towards Structural Stability of Social Networks (opens in a new tab)

  10. Theoretical and algorithmic approaches to field-programmable gate array partitioning

    … Integrated (VLSI) circuits can be modeled as graphs in which vertices represent components of the circuit and edges represent a relationship between these components. When expressed as graphs, these problems can then often be solved using graph theoretic methods. Unfortunately, many such …

    utk-theses Repository record for Theoretical and algorithmic approaches to field-programmable gate array partitioning (opens in a new tab)

  11. Allocation Strategies for Data-Oriented Architectures

    … strategies for data-oriented systems based on graph partitioning algorithms. Therefore, we show that systems from different application scenarios with different abstraction levels can be generalized to generic infrastructure and workload descriptions. We use weighted graph representations to …

    qucosa-diss

  12. Computational and Visual Analyses of Spatial Interactions: A Case Study of the County-to-County Migration In theUs

    … contains three different data spaces: (1) the geographic space, such as locations of origins and destinations; (2) the graph/network space, such as flows/links between locations; and (3) the multivariate space, including variables for locations (e.g., unemployment rate, median income) and flows …

    south-carolina Repository record for Computational and Visual Analyses of Spatial Interactions: A Case Study of the County-to-County Migration In theUs (opens in a new tab)

  13. A Graph Analytics Framework for Knowledge Discovery

    … to do knowledge discovery with big data. In RDF graph, concepts represent entities and predicates indicate properties that connect different entities. It is more crucial to figure out how different concepts are re lated within a single ontology or across multiple ontologies by analyzing predicates …

    umkc Repository record for A Graph Analytics Framework for Knowledge Discovery (opens in a new tab)

  14. Entropy-based framework for combinatorial optimization problems and enabling the grid of the future

    … resource allocation, routing, and scheduling, graph aggregation, and graph partition problems. These optimization problems are characterized by a combinatorial number of configurations, where a cost value can be assigned to each configuration, and the goal is to find the configuration that …

    uiuc Repository record for Entropy-based framework for combinatorial optimization problems and enabling the grid of the future (opens in a new tab)

  15. ΠΑΡΑΛΛΗΛΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΤΕΛΕΙΩΝ ΓΡΑΦΗΜΑΤΩΝ

    … ALGORITHMS ARE DESIGNED AND ANALYSED FOR GRAPH THEORETIC PROBLEMS, PARTICULARLY FOR PROBLEMS ON PERFECT GRAPHS. ALL ALGORITHMSARE BASED ON A NEW PRESENTATION OF THE UNDIRECTED GRAPHS. THE VERTEX SET V OF A GRAPH G=(V,E) IS PARTITIONED INTO SUBSETS, IN A SPECIFIC FASHION. WE CALL THESE …

    greece Repository record for ΠΑΡΑΛΛΗΛΟΙ ΑΛΓΟΡΙΘΜΟΙ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΤΕΛΕΙΩΝ ΓΡΑΦΗΜΑΤΩΝ (opens in a new tab)