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 11 of 11 for “"Hypergraph Partitioning"”.

  1. An effective algorithm for multiway hypergraph partitioning

    The problem of hypergraph partitioning has been around for more than a quarter of a century. Its early applications were centered on VLSI circuit design. In recent years, the application of hypergraph partitioning has been extended into the areas including data classifications, efficient storage of …

    concordia Download PDF for An effective algorithm for multiway hypergraph partitioning (opens in a new tab)

  2. Improving scalability of large-scale distributed Spiking Neural Network simulations on High Performance Computing systems using novel architecture-aware streaming hypergraph partitioning

    … the main contributors to scalability. We propose hypergraph partitioning to distribute neurons along computing nodes to minimise communication (increasing sparsity). A hypergraph is a generalisation of graphs, where a (hyper)edge can link 2 or more vertices at once. Coupled with a novel use of …

    whiterose Download PDF for Improving scalability of large-scale distributed Spiking Neural Network simulations on High Performance Computing systems using novel architecture-aware streaming hypergraph partitioning (opens in a new tab)

  3. Exploiting Latent Features of Text and Graphs

    … embedding, we advance the state-of-the-art in hypergraph partitioning quality. Having newfound intuition of graph embeddings, we present Agatha, a deep-learning approach to hypothesis generation. This system learns a data-driven ranking criteria derived from the embeddings of our large proposed …

    clemson Repository record for Exploiting Latent Features of Text and Graphs (opens in a new tab)

  4. Quantum and Classical Multilevel Algorithms for (Hyper)Graphs

    … by lack of high quality optimization solvers for hypergraph partitioning, in this thesis, we begin by discussing classical multilevel approaches for this problem. We present a novel relaxation-based vertex similarity measure termed algebraic distance for hypergraphs and the coarsening schemes …

    clemson Repository record for Quantum and Classical Multilevel Algorithms for (Hyper)Graphs (opens in a new tab)

  5. Towards scalable hypergraph processing algorithms and their applications

    … relations are expressed more naturally as hypergraphs. While hypergraphs are a generalization of graphs, state-of-the-art graph techniques are not adequate for solving large hypergraph tasks accurately in a reasonable time. Moreover, the field of hypergraph processing, such as learning and …

    texas Repository record for Towards scalable hypergraph processing algorithms and their applications (opens in a new tab)

  6. Blockchain-based Decentralized Energy Systems: Advancing Scalability, Security, Privacy, and Interoperability

    … integration into DES. The first solution, the Hypergraph-based Adaptive consoRtium Blockchain (HARB), targets scalability, a central issue in blockchain-enabled DES. HARB employs hypergraph theory and a community discovery mechanism to improve scalability by partitioning the network into …

    unsw Repository record for Blockchain-based Decentralized Energy Systems: Advancing Scalability, Security, Privacy, and Interoperability (opens in a new tab)

  7. Design automation for optical computing : Boolean logic and neural networks

    … capacity-constrained synthesis problem to the hypergraph partitioning and the min-cost max-flow problem. The experiments show the efficiency and efficacy of our method to generate smaller optical implementations for higher optical packaging density. In the third and fourth work, we focus on …

    texas Repository record for Design automation for optical computing : Boolean logic and neural networks (opens in a new tab)

  8. Data-driven Structure Detection in Optimization: Decomposition, Hub Location, and Brain Connectivity

    … community detection in lieu of traditional graph/hypergraph partitioning methods to alleviate one major drawback of the existing approaches in the literature: predefining the number of blocks. When tested on MIPLIB instances using the SAS/DECOMP framework, the proposed algorithm was found to …

    waterloo Repository record for Data-driven Structure Detection in Optimization: Decomposition, Hub Location, and Brain Connectivity (opens in a new tab)

  9. Algorithms for new objectives in graph partitioning and generalizations

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Algorithms for new objectives in graph partitioning and generalizations (opens in a new tab)

  10. Reinforcement Learning for Circuit Partitioning

    … a critical step. This process, known as circuit partitioning, minimizes the connections needed between these subcircuits while dividing the overall design. This can simplify the problem, and further enhance the performance and efficiency of other EDA tasks, such as placement and routing. A …

    guelph Repository record for Reinforcement Learning for Circuit Partitioning (opens in a new tab)