Concept
Complement graph
Related publications (85)
High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes
Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yifei Shen, Yuqing Ren, Chuan Zhang
Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...
Ieee-Inst Electrical Electronics Engineers Inc2024Graph generative deep learning models with an application to circuit topologies
Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison.Managing their complexity and facilitating their design drove part of the co-evolution of moder ...
EPFL2024The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.
We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...
Elsevier2024SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs
David Atienza Alonso, Giovanni Ansaloni, José Angel Miranda Calero, Rubén Rodríguez Álvarez, Juan Pablo Sapriza Araujo, Benoît Walter Denkinger
Coarse-Grain Reconfigurable Arrays (CGRAs) represent emerging low-power architectures designed to accelerate Compute-Intensive Loops (CILs). The effectiveness of CGRAs in providing acceleration relies on the quality of mapping: how efficiently the CIL is c ...
2024Acceleration of graph pattern mining and applications to financial crime
Various forms of real-world data, such as social, financial, and biological networks, can berepresented using graphs. An efficient method of analysing this type of data is to extractsubgraph patterns, such as cliques, cycles, and motifs, from graphs. For i ...
EPFL2023A full characterization of invariant embeddability of unimodular planar graphs
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...
WILEY2023DiGress: Discrete Denoising diffusion for graph generation
Pascal Frossard, Volkan Cevher, Igor Krawczuk, Bohan Wang, Clément Arthur Yvon Vignac
This work introduces DiGress, a discrete denoising diffusion model for generating graphs with categorical node and edge attributes. Our model utilizes a discrete diffusion process that progressively edits graphs with noise, through the process of adding or ...
2023Beyond Spectral Gap: The Role of the Topology in Decentralized Learning
Martin Jaggi, Thijs Vogels, Hadrien Hendrikx
In data-parallel optimization of machine learning models, workers collaborate to improve their estimates of the model: more accurate gradients allow them to use larger learning rates and optimize faster. In the decentralized setting, in which workers commu ...
Brookline2023Equivariant Neural Architectures for Representing and Generating Graphs
Graph machine learning offers a powerful framework with natural applications in scientific fields such as chemistry, biology and material sciences. By representing data as a graph, we encode the prior knowledge that the data is composed of a set of entitie ...
EPFL2023GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors
Mirjana Stojilovic, Guanglei Zhou
A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...
2023