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.
The common point between the different chapters of the present work is graph theory. We investigate some well known graph theory problems, and some which arise from more specific applications. In the first chapter, we deal with the maximum stable set probl ...
In this paper we present a navigation method for mobile robots in partially known indoor environments based on integration of graph based search algorithms and dynamic window local obstacle avoidance method. With the attention on a dynamic environment thre ...
Automatic failure-path inference (AFPI) is an application-generic, automatic technique for dynamically discovering the failure dependency graphs of componentized Internet applications. AFPI's first phase is invasive, and relies on controlled fault injectio ...
This paper establishes tight lower bounds on the time complexity of algorithms solving the generic broadcast problem. Generic broadcast assumes a symmetric, non-reflexive conflict relation on the set of messages, and requires ordered delivery only for conf ...
Autofluorescence (AF) bronchoscopy is a useful tool for early cancer detection. However the mechanisms involved in this diagnosis procedure are poorly understood. We present an in vivo autofluorescence imaging study to access the depth of the principal con ...
We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as estab ...
This paper studies the multicast routing and admission control problem on unit-capacity tree and mesh topologies in the throughput model. The problem is a generalization of the edge-disjoint paths problem and is NP-hard both on trees and meshes. We study b ...
The mechanisms by which the brain represents colors are largely unknown. In addition, the large number of color phenomena in the natural world has made understanding color rather difficult. Color transparency perception, which is studied in this thesis, is ...
This paper presents an approach to automatically extract and evaluate the ``stability'' of pronunciation variants (i.e., adequacy of the model to accommodate this variability), based on multiple pronunciations of each lexicon words and the knowledge of a r ...
We analyze whether Independant Component Analysis (ICA) is an appropriate tool for estimating spatial information in spatiochromatic mosaiced color images. In previous studies, ICA analysis of natural color scenes (Hoyer et al. 2000; Tailor et al., 2000; W ...
