Publication

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

Publications associées (37)

Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis

Water distribution systems (WDSs) are complex networks with numerous interconnected junctions and pipes. The robustness and reliability of these systems are critically dependent on their network structure, necessitating detailed analysis for proactive leak ...

Basel2024

Unambiguous DNFs and Alon-Saks-Seymour

Mika Tapani Göös, Siddhartha Jain

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

IEEE COMPUTER SOC2022

The Paris/Geneva Divide. A Network Analysis of the Archives of the International Committee on Intellectual Cooperation of the League of Nations

The International Committee on Intellectual Cooperation (ICIC) is often framed as a step in the constitution of a “League of Minds” – a place where scientists and writers reign, and a necessary part of a successful and harmonious “League of Nations” – but ...

De Gruyter2022

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

Christophe Ancey, Daniel Vito Papa

Braided rivers are highly dynamical systems characterized by varying network-like structures even under quasi-steady conditions. Understanding their dynamics is crucial in geomorphology and river engineering (e.g., river restoration in Alpine and piedmond ...

2020

Deep learning on graph for semantic segmentation of point cloud

Alexandre Thierry Robert Cherqui

This master thesis provides in-depth explanations of how deep learning and graph theory can be used together to perform pointwise classification in 3D point clouds obtained by combinations of geospatial images. That scene understanding problem arises in a ...

2018

In this paper, we address the resource allocation problem of device-to-device (D2D) communications underlaying orthogonal frequency division multiple access (OFDMA) based cellular systems by exploiting the efficiency that comes from an ensemble of graph th ...

IEEE2018

A 2D typology generator for historical masonry elements

Katrin Beyer, Shenghan Zhang, Martin Hofmann

The mechanical response of stone masonry depends on the properties of the components and also on the typology created by the stone units and the mortar joints. While the influence of the component strength on masonry is relatively well studied, few studies ...

2018

Cortical Dysconnectivity Measured by Structural Covariance Is Associated With the Presence of Psychotic Symptoms in 22q11.2 Deletion Syndrome

Dimitri Nestor Alice Van De Ville, Maude Schneider, Marie Schaer, Maria Carmela Padula

BACKGROUND: 22q11.2 deletion syndrome (22q11DS) is the third-largest known genetic risk factor for the development of psychosis. Dysconnectivity has consistently been implicated in the physiopathology of psychosis. Structural covariance of cortical morphol ...

2018

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

Arata Nakajo

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

Multi-level Logic Benchmarks: An Exactness Study

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa, Winston Jason Haaswijk

In this paper, we study exact multi-level logic benchmarks. We refer to an exact logic benchmark, or exact benchmark in short, as the optimal implementation of a given Boolean function, in terms of minimum number of logic levels and/or nodes. Exact benchma ...

Ieee2017

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