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.
One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021
Biomimetic behavior includes aspects such as learning from previous experience, self-diagnosis, and adaptation. This thesis describes control methodologies that are essential to development towards biomimetic behavior of a complex deployable structure. Sim ...
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 ...
We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...
The steady advance of computational methods makes model-based optimization an increasingly attractive method for process improvement. Unfortunately, the available models are often inaccurate. The traditional remedy is to update the model parameters, but th ...
We propose a novel algorithm for automatic text line extraction on color and grayscale manuscript pages without prior binarization.
Our algorithm is based on seam carving to compute separating seams between text lines.
Seam carving is likely to produce ...
Vision is a constructive process. For example, a square, flashed at two distinct locations one after the other, appears to move smoothly between the two locations rather than as two separate flashes (apparent motion). Apparent motion is usually perceived a ...
With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor ...
This work studies the problem of statistical inference for Fréchet means in the Wasserstein space of measures on Euclidean spaces, W2(Rd). This question arises naturally from the problem of separating amplitude and phase variation i ...
Increasingly detailed data on the network topology of neural circuits create a need for theoretical principles that explain how these networks shape neural communication. Here we use a model of cascade spreading to reveal architectural features of human br ...