Publications associées à Equivariant Neural Architectures for Representing and Generating Graphs

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.

Spectral MAB for Unknown Graph Processes

Pascal Frossard, Laura Toni

In this work, we study graph-based multi-arms bandit (MAB) problems aimed at optimizing actions on irregular and high-dimensional graphs. More formally, we consider a decision-maker that takes sequential actions over time and observes the experienced rewar ...

IEEE Computer Society2018

Finding Perfect Matchings in Bipartite Hypergraphs

Chidambaram Annamalai

Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perf ...

SPRINGER HEIDELBERG2018

A comparison of network embedding approaches

Thành Tâm Nguyên, Chi Thang Duong

Network embedding automatically learns to encode a graph into multi-dimensional vectors. The embedded representation appears to outperform hand-crafted features in many downstream machine learning tasks. There are a plethora of network embedding approaches ...

2018

The Sketching Complexity of Graph and Hypergraph Counting

Mikhail Kapralov, John Michael Goddard Kallaugher

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been ...

IEEE COMPUTER SOC2018

Global and Local Uncertainty Principles for Signals on Graphs

Pierre Vandergheynst, Nathanaël Perraudin, Benjamin Ricaud, David Shuman

Uncertainty principles such as Heisenberg's provide limits on the time-frequency concentration of a signal, and constitute an important theoretical tool for designing and evaluating linear signal transforms. Generalizations of such principles to the graph ...

2018

A graph learning approach for light field image compression

Touradj Ebrahimi, Pascal Frossard, Irene Viola, Hermina Petric Maretic

In recent years, light field imaging has attracted the attention of the academic and industrial communities thanks to its enhanced rendering capabilities that allow to visualise contents in a more immersive and interactive way. However, those enhanced capa ...

Spie-Int Soc Optical Engineering2018

Compiling Questions into Balanced Quizzes about Documents

Robert West, Cristina Menghini

In the educational framework, knowledge assessment is a critical component, and quizzes (sets of questions with concise answers) are a popular tool for this purpose. This paper focuses on the generation of balanced quizzes, i.e., quizzes that relate to a g ...

ASSOC COMPUTING MACHINERY2018

Execution Trace Graph of Dataflow Process Networks

Marco Mattavelli, Simone Casale Brunet

The paper introduces and specifies a formalism that provides complete representations of dataflow process network (DPN) program executions, by means of directed acyclic graphs. Such graphs, also known as execution trace graphs (ETG), are composed of nodes ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Rate Distortion Optimized Graph Partitioning for Omnidirectional Image Coding

Pascal Frossard, Francesca De Simone, Thomas Maugey, Mira Rizkallah

Omnidirectional images are spherical signals captured by cameras with 360-degree field of view. In order to be compressed using existing encoders, these signals are mapped to planar domain. A commonly used planar representation is the equirectangular one, ...

IEEE COMPUTER SOC2018

Equivariant Neural Architectures for Representing and Generating Graphs

Graph Chatbot

Chattez avec Graph Search

Spectral MAB for Unknown Graph Processes

Finding Perfect Matchings in Bipartite Hypergraphs

A comparison of network embedding approaches

Apartment Structure Estimation Using Fully Convolutional Networks and Graph Model

The Sketching Complexity of Graph and Hypergraph Counting

Global and Local Uncertainty Principles for Signals on Graphs

A graph learning approach for light field image compression

Compiling Questions into Balanced Quizzes about Documents

Execution Trace Graph of Dataflow Process Networks

Rate Distortion Optimized Graph Partitioning for Omnidirectional Image Coding

Global and Local Uncertainty Principles for Signals on Graphs

Compiling Questions into Balanced Quizzes about Documents

Apartment Structure Estimation Using Fully Convolutional Networks and Graph Model

Spectral MAB for Unknown Graph Processes

A graph learning approach for light field image compression

Execution Trace Graph of Dataflow Process Networks

Finding Perfect Matchings in Bipartite Hypergraphs

A comparison of network embedding approaches

The Sketching Complexity of Graph and Hypergraph Counting

Rate Distortion Optimized Graph Partitioning for Omnidirectional Image Coding