Publications associées à Line graph

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

On 2-Level Polytopes Arising In Combinatorial Settings

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...

SIAM PUBLICATIONS2018

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

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Slobodan Mitrovic, Mohsen Ghaffari

We present O(log log n)-round algorithms in the Massively Parallel Computation (MPC) model, with a(n) memory per machine, that compute a maximal independent set, a 1 + epsilon approximation of maximum matching, and a 2 + epsilon approximation of minimum ve ...

ASSOC COMPUTING MACHINERY2018

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

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Henry Markram, Kathryn Hess Bellwald, Michael Reimann, Rodrigo de Campos Perin, Giuseppe Chindemi, Martina Scolamiero, Ran Levi, Max Christian Nolte, Katharine Felicity Turner, Pawel Tadeusz Dlotko

The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission i ...

Frontiers Media Sa2017

Learning time varying graphs

Pascal Frossard, Andreas Loukas, Vasilis Kalofolias

We consider the problem of inferring the hidden structure of high-dimensional dynamic systems from the perspective of graph learning. In particular, we aim at capturing the dynamic relationships between nodes by a sequence of graphs. Our approach is motiva ...

Ieee2017

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.

Line graph

Global and Local Uncertainty Principles for Signals on Graphs

On 2-Level Polytopes Arising In Combinatorial Settings

Execution Trace Graph of Dataflow Process Networks

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Spectral MAB for Unknown Graph Processes

Finding Perfect Matchings in Bipartite Hypergraphs

Round Compression for Parallel Matching Algorithms

On some problems related to 2-level polytopes

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Learning time varying graphs

Graph Chatbot

Chattez avec Graph Search

Execution Trace Graph of Dataflow Process Networks

On 2-Level Polytopes Arising In Combinatorial Settings

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Spectral MAB for Unknown Graph Processes

Round Compression for Parallel Matching Algorithms

On some problems related to 2-level polytopes

Learning time varying graphs

Global and Local Uncertainty Principles for Signals on Graphs

Finding Perfect Matchings in Bipartite Hypergraphs

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function