Výsledky vyhledávání - Mathematics of computing-Graph algorithms*
-
1
GraphCoder: Enhancing Repository-Level Code Completion via Coarse-to-fine Retrieval Based on Code Context Graph
ISSN: 2643-1572Vydáno: ACM 27.10.2024Vydáno v IEEE/ACM International Conference on Automated Software Engineering : [proceedings] (27.10.2024)“…The performance of repository-level code completion depends upon the effective leverage of both general and repository-specific knowledge. Despite the…”
Získat plný text
Konferenční příspěvek -
2
Metro Maps on Octilinear Grid Graphs
ISSN: 0167-7055, 1467-8659Vydáno: Oxford Blackwell Publishing Ltd 01.06.2020Vydáno v Computer graphics forum (01.06.2020)“…Schematic transit maps (often called “metro maps” in the literature) are important to produce comprehensible visualizations of complex public transit networks…”
Získat plný text
Journal Article -
3
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. It has recently been shown that the expressiveness of…”
Získat plný text
Konferenční příspěvek -
4
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)“…Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the…”
Získat plný text
Konferenční příspěvek -
5
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. These methods are attractive because they enable…”
Zjistit podrobnosti o přístupu
Journal Article -
6
Graph Representation Learning for Microarchitecture Design Space Exploration
Vydáno: IEEE 09.07.2023Vydáno v 2023 60th ACM/IEEE Design Automation Conference (DAC) (09.07.2023)“…Design optimization of modern microprocessors is a complex task due to the exponential growth of the design space. This work presents GRL-DSE, an automatic…”
Získat plný text
Konferenční příspěvek -
7
Clone detection in automotive model-based development
ISBN: 1424444861, 9781424444861, 1605580791, 9781605580791ISSN: 0270-5257Vydáno: IEEE 01.01.2008Vydáno v 2008 ACM/IEEE 30th International Conference on Software Engineering (01.01.2008)“…Model-based development is becoming an increasingly common development methodology. In important domains like embedded systems already major parts of the code…”
Získat plný text
Konferenční příspěvek Journal Article -
8
GraphFI: An Efficient Fault Injection Framework for Graph Processing on GPGPUs
Vydáno: IEEE 22.06.2025Vydáno v 2025 62nd ACM/IEEE Design Automation Conference (DAC) (22.06.2025)“…As graph tasks become pervasive in real-time and safetycritical domains (e.g., financial fraud detection and electrical power systems), it is also essential to…”
Získat plný text
Konferenční příspěvek -
9
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. Processing-in-memory (PIM) architecture based on the ReRAM…”
Získat plný text
Konferenční příspěvek -
10
TurboBC: A Memory Efficient and Scalable GPU Based Betweenness Centrality Algorithm in the Language of Linear Algebra
ISSN: 2375-530X, 2375-530XVydáno: United States 01.08.2021Vydáno v Proceedings - International Workshops on Parallel Processing (01.08.2021)“…Betweenness centrality (BC) is a shortest path centrality metric used to measure the influence of individual vertices or edges on huge graphs that are used for…”
Zjistit podrobnosti o přístupu
Journal Article -
11
Re-imaginig the Networks: Detecting Local Communities in Networks by Approximating Derivatives in Graph Space
ISBN: 1450349935, 9781450349932ISSN: 2473-991XVydáno: New York, NY, USA ACM 31.07.2017Vydáno v 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (31.07.2017)“…Finding communities in networks has become very important because various social and physical complex systems are represented as networks. Because of their…”
Získat plný text
Konferenční příspěvek -
12
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…”
Získat plný text
Konferenční příspěvek -
13
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 -
14
HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering
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 introduces a scalable algorithmic framework (HyperEF) for spectral coarsening (decomposition) of large-scale hypergraphs by exploiting hyperedge…”
Získat plný text
Konferenční příspěvek -
15
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…”
Získat plný text
Konferenční příspěvek -
16
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)“…Balanced hypergraph partitioning is a fundamental problem in applications like VLSI design, high-performance computing, etc. Nowadays, large-scale hypergraphs…”
Získat plný text
Konferenční příspěvek -
17
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…”
Získat plný text
Konferenční příspěvek -
18
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…”
Získat plný text
Konferenční příspěvek -
19
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)“…Electromigration (EM) becomes a major concern for VLSI circuits as the technology advances in the nanometer regime. With Korhonen equations, EM assessment for…”
Získat plný text
Konferenční příspěvek -
20
An effective GPU implementation of breadth-first search
ISBN: 9781424466771, 1424466776ISSN: 0738-100XVydáno: IEEE 13.06.2010Vydáno v Design Automation Conference (13.06.2010)“…Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as well as in other fields. Researchers have tried to accelerate BFS on…”
Získat plný text
Konferenční příspěvek

