Publications associées à A Magnetic Procedure for the Stability Number

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.

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

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

Everything You Always Wanted to Know about Multicore Graph Processing but Were Afraid to Ask

Willy Zwaenepoel, Baptiste Joseph Eustache Lepers, Jasmina Malicevic

Graph processing systems are used in a wide variety of fields, ranging from biology to social networks, and a large number of such systems have been described in the recent literature. We perform a systematic comparison of various techniques proposed to sp ...

USENIX Association2017

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017

Soft Magnets Implementation using a Stereolithography-based 3D Printer

Yves Perriard, Paolo Germano, Cécile Gisèle Aimée Jeannine Cuchet, Augustin Muster

A wide part of the proposed paper is devoted to designing soft magnets using a stereolithography 3D printer. A state of the art on soft magnetic materials is carried out together with an overview of the existing printing technologies to obtain complex non- ...

2017

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

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

A Magnetic Procedure for the Stability Number

Graph Chatbot

Chattez avec Graph Search

Distributed Diffusion Adaptation Over Graph Signals

On 2-Level Polytopes Arising In Combinatorial Settings

Execution Trace Graph of Dataflow Process Networks

Graph-based Methods for Visualization and Clustering

Everything You Always Wanted to Know about Multicore Graph Processing but Were Afraid to Ask

On Simplices in Diameter Graphs in R-4

Graph-based structures in data science

Soft Magnets Implementation using a Stereolithography-based 3D Printer

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Graph-based structures in data science

Distributed Diffusion Adaptation Over Graph Signals

Graph-based Methods for Visualization and Clustering

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Everything You Always Wanted to Know about Multicore Graph Processing but Were Afraid to Ask

Execution Trace Graph of Dataflow Process Networks

On Simplices in Diameter Graphs in R-4

Soft Magnets Implementation using a Stereolithography-based 3D Printer

On 2-Level Polytopes Arising In Combinatorial Settings