Publications associées à A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

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.

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

Graph Heat Mixture Model Learning

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic

Graph inference methods have recently attracted a great interest from the scientific community, due to the large value they bring in data interpretation and analysis. However, most of the available state-of-the-art methods focus on scenarios where all avai ...

IEEE2018

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

AiiDA: automated interactive infrastructure and database for computational science

Nicola Marzari, Giovanni Pizzi, Boris Kozinsky, Andrea Cepellotti, Riccardo Sabatini

Computational science has seen in the last decades a spectacular rise in the scope, breadth, and depth of its efforts. Notwithstanding this prevalence and impact, it is often still performed using the renaissance model of individual artisans gathered in a ...

Elsevier Science Bv2016

From Compact Semi-Toric Systems To Hamiltonian S-1-Spaces

Silvia Sabatini

We show how any labeled convex polygon associated to a compact semi-toric system, as de fined by V (u) over tilde Ngoc, determines Karshon's labeled directed graph which classifies the underlying Hamiltonian S-1-space up to isomorphism. Then we characteriz ...

Amer Inst Mathematical Sciences2015

Microcontaminant degradation in municipal wastewater treatment plant secondary effluent by EDDS assisted photo-Fenton at near-neutral pH: An experimental design approach

César Pulgarin, Stefanos Papoutsakis

This work aims to evaluate the applicability of EDDS (ethylenediamine-N,N'-disuccinic acid) as an iron chelating agent for photo-Fenton treatment of municipal wastewater spiked with organic contaminants at near-neutral pH. A series of laboratory scale expe ...

Elsevier2015

Cellular properties of nilpotent spaces

Jérôme Scherer

We show that cellular approximations of nilpotent Postnikov stages are always nilpotent Postnikov stages, in particular classifying spaces of nilpotent groups are turned into classifying spaces of nilpotent groups. We use a modified Bousfield-Kan homology ...

Geometry & Topology Publications2015

A Unified Experiment Design Approach for Cyclic and Acyclic Causal Models

Graph Chatbot

Chattez avec Graph Search

Execution Trace Graph of Dataflow Process Networks

Graph Heat Mixture Model Learning

Exploring Selection Bias by Causal Frailty Models

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

AiiDA: automated interactive infrastructure and database for computational science

Free Edge Lengths in Plane Graphs

From Compact Semi-Toric Systems To Hamiltonian S-1-Spaces

Microcontaminant degradation in municipal wastewater treatment plant secondary effluent by EDDS assisted photo-Fenton at near-neutral pH: An experimental design approach

Cellular properties of nilpotent spaces

Independence number of generalized Petersen graphs

Scaling a Reliable Distributed System

Execution Trace Graph of Dataflow Process Networks

Graph Heat Mixture Model Learning

Exploring Selection Bias by Causal Frailty Models

AiiDA: automated interactive infrastructure and database for computational science

Free Edge Lengths in Plane Graphs

From Compact Semi-Toric Systems To Hamiltonian S-1-Spaces

Microcontaminant degradation in municipal wastewater treatment plant secondary effluent by EDDS assisted photo-Fenton at near-neutral pH: An experimental design approach

Cellular properties of nilpotent spaces