Concept

Problème de plus court chemin

Publications associées (252)

Laser scanning images analysis for tunnel inspection

Laser scanning is commonly used in railways for detecting problems related with the clearance profile which are quite common especially in old tunnels. By increasing the resolution of the scanner system it is possible to use the images for identifying prob ...

CRC Press - Balkema2011

Resource Utilisation Analysis in WDM Backbone Networks

Sébastien Rumley, Christian Gaumier

Circuit-switched backbone networks are appealing especially due to their low switching cost. However, some of their links may be poorly utilised with respect to the available capacity. Grooming can be used to improve this utilisation: optically switched li ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Geodesic Active Fields - A Geometric Framework for Image Registration

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso

In this paper we present a novel geometric framework called geodesic active fields for general image registration. In image registration, one looks for the underlying deformation field that best maps one image onto another. This is a classic ill-posed inve ...

Institute of Electrical and Electronics Engineers2011

Communication assisted navigation in robotic swarms: self-organization and cooperation

Francesco Mondada

We present a communication based navigation algorithm for robotic swarms. It lets robots guide each other's navigation by exchanging messages containing navigation information through the wireless network formed among the swarm. We study the use of this al ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

A stochastic reach-avoid problem with random obstacles

Maryam Kamgarpour, John Lygeros

We present a dynamic programming based solution to a stochastic reachability problem for a controlled discrete-time stochastic hybrid system. A sum-multiplicative cost function is introduced along with a corresponding dynamic recursion which quantifies the ...

ACM Press2011

Can One Hear the Shape of a Room: The 2–D Polygonal Case

Martin Vetterli, Yue Lu, Ivan Dokmanic

We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RIRs. In contrast, we are interested in reconstructing the room geometry from a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

An Integrative Approach to Light- and Heavy-Weighted Route Planning Problems

The single-source shortest path problem (SSSP) frequently arises in practical applications of todays Intelligent Transport Systems (ITS). E.g. for route planning or traffic assignment, several variants of Dijkstra’s algorithm or the A* algorithm have been ...

2010

Connected facility location via random facility sampling and core detouring

Friedrich Eisenbrand, Thomas Rothvoss

We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unconnected facility location problem, randomly sample the clients, and open the ...

2010

Stable routing under the Spanning Tree Protocol

Laura Sanità

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

Oriented paths in n-chromatic digraphs

Rajai Nasser

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...

2010

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