Publication

rDAN: Toward robust demand-aware network designs

Publications associées (32)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

The kinectome: A comprehensive kinematic map of human motion in health and disease

Enrico Amico, Antonella Romano, Emahnuel Troisi Lopez

Human voluntary movement stems from the coordinated activations in space and time of many musculoskeletal segments. However, the current methodological approaches to study human movement are still limited to the evaluation of the synergies among a few body ...

WILEY2022

Dynamic Quantification of the Effect of Traffic Congestion on a Multilayer Network

The paper “Dynamic efficiency in multilayer transportation networks” (Bellocchi, Geroliminis, 2018) [1] introduced new performance measures to quantify dynamically the effect of traffic congestion in a multilayer network. Based on these measures, we explor ...

2020

Extrapolating Paths with Graph Neural Networks

Andreas Loukas, Jean-Baptiste Francis Marie Juliette Cordonnier

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the int ...

IJCAI, Inc.2019

Traffic Receipts for Network Transparency

Pavlos Nikolopoulos

Today's Internet is not transparent: when packets get lost or delayed, there is typically no information about where the problem occurred, hence no information about who is responsible. This results in Internet service providers (ISPs) offering service lev ...

EPFL2018

Alignment and Assembly

Lyudmila Yartseva

Over recent years, many large network datasets become available, giving rise to novel and valuable applications of data mining and machine learning techniques. These datasets include social networks, the structure of the Internet, and protein-interaction n ...

EPFL2017

We present a fully analytical, heuristic model the "Analytical Transport Network Model" for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a ...

Elsevier Science Bv2017

An affected core drives network integration deficits of the structural connectome in 22q11.2 deletion syndrome

Alessandra Griffa, Patric Hagmann, Marie Schaer, Frantisek Vasa

Chromosome 22q11.2 deletion syndrome (22q11DS) is a genetic disease known to lead to cerebral structural alterations, which we study using the framework of the macroscopic white-matter connectome. We create weighted connectomes of 44 patients with 22q11DS ...

Elsevier Sci Ltd2016

The MEU web platform: a tool dedicated to urban energy management

Gaëtan Cherix, Massimiliano Capezzali, Pablo Puerto, Mathias Franz Pernet

The MEU GIS-enabled web-platform [1] has been developed in close collaboration with four Swiss cities. The tool enables detailed monitoring and planning for both energy demand and supply at individual building, neighborhood and whole city scale (http://meu ...

LESO-PB, EPFL2015

Effective information flow over mobile adaptive networks

Ali H. Sayed

Collective motion is a remarkable phenomenon in biological systems. There have been several models in the literature to regenerate this type of motion, such as averaging consensus strategies where nodes continuously average the velocity vectors of their ne ...

IEEE2012

, , ,

In networks that perform linear network coding, an intermediate network node may receive a much larger number of linear equations of the source symbols than the number of messages it needs to send. For networks constructed by untrusted nodes, we propose a ...

2012