Publications associées à DPS - Dynamic Parallel Schedules

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.

Improved Ramsey-type results for comparability graphs

Istvan Tomon, Dániel József Korándi

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...

CAMBRIDGE UNIV PRESS2020

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Ola Nils Anders Svensson

A sparsifier of a graph G (Bencztir and Karger; Spielman and Teng) is a sparse weighted subgraph (G) over tilde that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs ...

IEEE COMPUTER SOC2019

Distributed Diffusion Adaptation Over Graph Signals

Ali H. Sayed, Jie Chen, Roula Nassif

Most works on graph signal processing assume static graph signals, which is a limitation even in comparison to traditional DSP techniques where signals are modeled as sequences that evolve over time. For broader applicability, it is necessary to develop te ...

IEEE2018

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

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Pierre Vandergheynst, Kirell Maël Benzi, Benjamin Ricaud

Graphs are now ubiquitous in almost every field of research. Recently, new research areas devoted to the analysis of graphs and data associated to their vertices have emerged. Focusing on dynamical processes, we propose a fast, robust and scalable framewor ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Non-Rigid Graph Registration using Active Testing Search

Pascal Fua, Raphael Sznitman, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good init ...

Institute of Electrical and Electronics Engineers2015

A Bayesian Method for Matching Two Similar Graphs without Seeds

Matthias Grossglauser, Pedram Pedarsani

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

DPS - Dynamic Parallel Schedules

Graph Chatbot

Chattez avec Graph Search

Edge colorings of graphs without monochromatic stars

Improved Ramsey-type results for comparability graphs

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Distributed Diffusion Adaptation Over Graph Signals

Execution Trace Graph of Dataflow Process Networks

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Independence number of generalized Petersen graphs

Non-Rigid Graph Registration using Active Testing Search

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

A Bayesian Method for Matching Two Similar Graphs without Seeds

Improved Ramsey-type results for comparability graphs

Edge colorings of graphs without monochromatic stars

Non-Rigid Graph Registration using Active Testing Search

Execution Trace Graph of Dataflow Process Networks

New Notions and Constructions of Sparsification for Graphs and Hypergraphs

Principal Patterns on Graphs: Discovering Coherent Structures in Datasets

Independence number of generalized Petersen graphs

THE NUMBER OF EDGES IN k-QUASI-PLANAR GRAPHS

A Bayesian Method for Matching Two Similar Graphs without Seeds

Distributed Diffusion Adaptation Over Graph Signals