Výsledky vyhledávání - Graph Theory—graph algorithms~
-
1
The Logic of Graph Neural Networks
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Graph neural networks (GNNs) are deep learning architectures for machine learning problems on graphs…”
Získat plný text
Konferenční příspěvek -
2
Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs
Vydáno: IEEE 01.09.2021Vydáno v 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT) (01.09.2021)“…Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt computing-intensive algorithms on large-scale graphs…”
Získat plný text
Konferenční příspěvek -
3
BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“… Thus, fast and high-quality deterministic partitioning algorithms are largely in demand…”
Získat plný text
Konferenční příspěvek -
4
PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration
Vydáno: IEEE 05.12.2021Vydáno v 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“…Graph Convolutional Network (GCN) is a promising but computing- and memory-intensive learning model…”
Získat plný text
Konferenční příspěvek -
5
iG-kway: Incremental k-way Graph Partitioning on GPU
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Recent advances in GPU-accelerated graph partitioning have achieved significant performance gains but remain limited to full graph partitioning, lacking support for incremental updates…”
Získat plný text
Konferenční příspěvek -
6
GPart: A GNN-Enabled Multilevel Graph Partitioner
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…This paper introduces GPart, a scalable multilevel framework for graph partitioning that integrates GNN embeddings with efficient coarsening and refinement techniques…”
Získat plný text
Konferenční příspěvek -
7
The Readability of Path-Preserving Clusterings of Graphs
ISSN: 0167-7055, 1467-8659Vydáno: Oxford, UK Blackwell Publishing Ltd 01.06.2010Vydáno v Computer graphics forum (01.06.2010)“…Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs…”
Získat plný text
Journal Article -
8
DS-GL: Advancing Graph Learning via Harnessing Nature's Power within Scalable Dynamical Systems
Vydáno: IEEE 29.06.2024Vydáno v 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) (29.06.2024)“…With the rapid digitization of the world, an increasing number of real-world applications are turning to non-Euclidean data, modeled as graphs…”
Získat plný text
Konferenční příspěvek -
9
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Dynamic graph processing systems using conventional array-based architectures face significant throughput limitations due to inefficient memory access and index management…”
Získat plný text
Konferenční příspěvek -
10
EMGraph: Fast Learning-Based Electromigration Analysis for Multi-Segment Interconnect Using Graph Convolution Networks
Vydáno: IEEE 05.12.2021Vydáno v 2021 58th ACM/IEEE Design Automation Conference (DAC) (05.12.2021)“… VLSI multisegment interconnect trees can be naturally viewed as graphs. Based on this observation, we propose a new graph convolution network (GCN…”
Získat plný text
Konferenční příspěvek -
11
Lovász-Type Theorems and Game Comonads
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… As special cases of this general theorem, we obtain two variants of Lovász' theorem: the result by Dvořák (2010) that characterises equivalence of graphs in the k…”
Získat plný text
Konferenční příspěvek -
12
SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction
Vydáno: IEEE 01.09.2021Vydáno v 2021 30th International Conference on Parallel Architectures and Compilation Techniques (PACT) (01.09.2021)“…Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance…”
Získat plný text
Konferenční příspěvek -
13
Bioprospecting Trichoderma: A Systematic Roadmap to Screen Genomes and Natural Products for Biocontrol Applications
ISSN: 2673-6128, 2673-6128Vydáno: United States Frontiers Media S.A 16.09.2021Vydáno v Frontiers in fungal biology (16.09.2021)“…Natural products derived from microbes are crucial innovations that would help in reaching sustainability development goals worldwide while achieving…”
Získat plný text
Journal Article -
14
The neuroanatomical organization of the hypothalamus is driven by spatial and topological efficiency
ISSN: 1662-5137, 1662-5137Vydáno: Switzerland Frontiers Media S.A 05.08.2024Vydáno v Frontiers in systems neuroscience (05.08.2024)“…The hypothalamus in the mammalian brain is responsible for regulating functions associated with survival and reproduction representing a complex set of highly…”
Získat plný text
Journal Article -
15
SGIRR: Sparse Graph Index Remapping for ReRAM Crossbar Operation Unit and Power Optimization
ISSN: 1558-2434Vydáno: ACM 29.10.2022Vydáno v 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (29.10.2022)“… This paper proposes a two-stage algorithm with a crossbar OU-aware scheme for sparse graph index remapping for ReRAM (SGIRR…”
Získat plný text
Konferenční příspěvek -
16
Local Higher-Order Graph Clustering
ISSN: 2154-817XVydáno: United States 01.08.2017Vydáno v Proceedings / International Conference on Knowledge Discovery and Data Mining (01.08.2017)“…Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph…”
Zjistit podrobnosti o přístupu
Journal Article -
17
Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA
ISBN: 9780821890387, 0821890387Vydáno: Providence, R.I American Mathematical Society 2013“… To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li…”
Získat plný text
E-kniha Kniha -
18
Dynamic Allocation of Processor Cores to Graph Applications on Commodity Servers
Vydáno: IEEE 21.10.2023Vydáno v 2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) (21.10.2023)“…Graph processing is increasingly adopted to solve problems that span many application domains, including scientific computing, social networks, and big-data analytics…”
Získat plný text
Konferenční příspěvek -
19
A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs
ISSN: 2641-7936Vydáno: IEEE 01.09.2019Vydáno v Proceedings / International Conference on Parallel Architectures and Compilation Techniques (01.09.2019)“… We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs…”
Získat plný text
Konferenční příspěvek -
20
A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…Quantum graph states are critical resources for various quantum algorithms, and also determine essential interconnections in distributed quantum computing…”
Získat plný text
Konferenční příspěvek

