Výsledky vyhľadávania - "Graph Theory— Graph algorithms"
-
1
The Logic of Graph Neural Networks
Vydavateľské údaje: IEEE 29.06.2021Vydané 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ískať plný text
Konferenčný príspevok.. -
2
Bioprospecting Trichoderma: A Systematic Roadmap to Screen Genomes and Natural Products for Biocontrol Applications
ISSN: 2673-6128, 2673-6128Vydavateľské údaje: United States Frontiers Media S.A 16.09.2021Vydané 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ískať plný text
Journal Article -
3
The neuroanatomical organization of the hypothalamus is driven by spatial and topological efficiency
ISSN: 1662-5137, 1662-5137Vydavateľské údaje: Switzerland Frontiers Media S.A 05.08.2024Vydané 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ískať plný text
Journal Article -
4
The Readability of Path-Preserving Clusterings of Graphs
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.06.2010Vydané 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. This filtering can be done in…”
Získať plný text
Journal Article -
5
Lovász-Type Theorems and Game Comonads
Vydavateľské údaje: IEEE 29.06.2021Vydané 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ískať plný text
Konferenčný príspevok.. -
6
Eigenvector Centrality Dynamics From Resting-State fMRI: Gender and Age Differences in Healthy Subjects
ISSN: 1662-453X, 1662-4548, 1662-453XVydavateľské údaje: Switzerland Frontiers Research Foundation 27.06.2019Vydané v Frontiers in neuroscience (27.06.2019)“…With the increasing use of functional brain network properties as markers of brain disorders, efficient visualization and evaluation methods have become…”
Získať plný text
Journal Article -
7
Hydrogen-bond networks for proton couplings in G-Protein coupled receptors
ISSN: 2296-424X, 2296-424XVydavateľské údaje: Frontiers Media S.A 06.09.2022Vydané v Frontiers in physics (06.09.2022)“…G-protein signaling pathways mediate communication across cell membranes. The first steps of this communication occur at the cell membrane, where upon…”
Získať plný text
Journal Article -
8
Local Higher-Order Graph Clustering
ISSN: 2154-817XVydavateľské údaje: United States 01.08.2017Vydané 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…”
Zistit podrobnosti o prístupe
Journal Article -
9
Graph Representation Learning for Microarchitecture Design Space Exploration
Vydavateľské údaje: IEEE 09.07.2023Vydané 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ískať plný text
Konferenčný príspevok.. -
10
A Visualization Framework and User Studies for Overloaded Orthogonal Drawings
ISSN: 0167-7055, 1467-8659Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.02.2018Vydané v Computer graphics forum (01.02.2018)“…Overloaded orthogonal drawing (OOD) is a recent graph visualization style specifically conceived for directed graphs. It merges the advantages of some popular…”
Získať plný text
Journal Article -
11
Clone detection in automotive model-based development
ISBN: 1424444861, 9781424444861, 1605580791, 9781605580791ISSN: 0270-5257Vydavateľské údaje: IEEE 01.01.2008Vydané 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ískať plný text
Konferenčný príspevok.. Journal Article -
12
GraphFI: An Efficient Fault Injection Framework for Graph Processing on GPGPUs
Vydavateľské údaje: IEEE 22.06.2025Vydané 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ískať plný text
Konferenčný príspevok.. -
13
PIMGCN: A ReRAM-Based PIM Design for Graph Convolutional Network Acceleration
Vydavateľské údaje: IEEE 05.12.2021Vydané 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ískať plný text
Konferenčný príspevok.. -
14
GraphCoder: Enhancing Repository-Level Code Completion via Coarse-to-fine Retrieval Based on Code Context Graph
ISSN: 2643-1572Vydavateľské údaje: ACM 27.10.2024Vydané 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ískať plný text
Konferenčný príspevok.. -
15
TurboBC: A Memory Efficient and Scalable GPU Based Betweenness Centrality Algorithm in the Language of Linear Algebra
ISSN: 2375-530X, 2375-530XVydavateľské údaje: United States 01.08.2021Vydané 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…”
Zistit podrobnosti o prístupe
Journal Article -
16
iG-kway: Incremental k-way Graph Partitioning on GPU
Vydavateľské údaje: IEEE 22.06.2025Vydané 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ískať plný text
Konferenčný príspevok.. -
17
A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State
Vydavateľské údaje: IEEE 22.06.2025Vydané 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ískať plný text
Konferenčný príspevok.. -
18
HyperEF: Spectral Hypergraph Coarsening by Effective-Resistance Clustering
ISSN: 1558-2434Vydavateľské údaje: ACM 29.10.2022Vydané 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ískať plný text
Konferenčný príspevok.. -
19
BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning
Vydavateľské údaje: IEEE 22.06.2025Vydané 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ískať plný text
Konferenčný príspevok.. -
20
LearnGraph: A Learning-Based Architecture for Dynamic Graph Processing
Vydavateľské údaje: IEEE 22.06.2025Vydané 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ískať plný text
Konferenčný príspevok..

