Publications associées à Graphe arête-connexe

The Privacy Power of Correlated Noise in Decentralized Learning

Rachid Guerraoui, Martin Jaggi, Anastasiia Koloskova, Youssef Allouah, Aymane El Firdoussi

Decentralized learning is appealing as it enables the scalable usage of large amounts of distributed data and resources (without resorting to any central entity), while promoting privacy since every user minimizes the direct exposure of their data. Yet, wi ...

PMLR2024

Better Trees for Santa Claus

Etienne Michel François Bamas, Lars Rohwedder

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

New York2023

DiGress: 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 ...

2023

Motif Cut Sparsifiers

Mikhail Kapralov, Mikhail Makarov, Jakab Tardos

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

IEEE COMPUTER SOC2022

Screw vs. edge dislocation strengthening in body-centered-cubic high entrophy alloys and implications for guided alloy design

William Curtin, Francesco Maresca, Carolina Baruffi

Body-centered-cubic (BCC) high entropy alloys (HEAs) can show exceptionally high strength up to high temperatures. Mechanistic theories are needed to guide alloy discovery within the immense multicomponent HEA compositional space. Here, two new theories fo ...

SPRINGER HEIDELBERG2022

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Yu Bai, Zhengwen Jiang, Yihe Zhao, Jie Li, Zichen Liu

A capacitive micromachined ultrasonic transducers (CMUTs) array with dual-mixed radii is designed to improve bandwidth and realize multi-modes operating for immersed ultrasonic applications. The two-size (TS) CMUT array is composed of two sub-arrays with d ...

IEEE2021

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Felix Schürmann, Bruno Ricardo Da Cunha Magalhães

Graph-based representations underlie a wide range of scientific problems. Graph connectivity is typically represented as a sparse matrix in the Compressed Sparse Row format. Large-scale graphs rely on distributed storage, allocating distinct subsets of row ...

2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Graphe arête-connexe

The Privacy Power of Correlated Noise in Decentralized Learning

Better Trees for Santa Claus

DiGress: Discrete Denoising diffusion for graph generation

Graph signal processing tailored for subgraph focus and community structure

Motif Cut Sparsifiers

Screw vs. edge dislocation strengthening in body-centered-cubic high entrophy alloys and implications for guided alloy design

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

Graph Chatbot

Chattez avec Graph Search

Better Trees for Santa Claus

Motif Cut Sparsifiers

The Privacy Power of Correlated Noise in Decentralized Learning

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

DiGress: Discrete Denoising diffusion for graph generation

Graph signal processing tailored for subgraph focus and community structure

Screw vs. edge dislocation strengthening in body-centered-cubic high entrophy alloys and implications for guided alloy design

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices