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.
We present and analyse a model of the combined choice of departure time and route in a congested road network. Using the property of equilibrium solutions that for each origin-destination pair the total cost associated with travel is identical for all trav ...
This paper presents a progressive coding scheme for 3D objects, based on an overcomplete decomposition of the 3D model on a sphere. Due to increased freedom in the bases construction, redundant expansions have shown interesting approximation properties in ...
Exploratory search over a collection often requires users to iteratively apply a variety of strategies, such as searching for more general or more specific concepts in reaction to the information they encounter. Rich semantic models, such as WordNet, are p ...
We propose a non-iterative solution to the PnP problem---the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences---whose computational complexity grows linearly with n. This is in contrast to state-of-the-art method that are ...
We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences-whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O( ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We consider the case of a FIFO multiplexer fed by flows that are individually constrained by piecewise linear concave arrival curves. We show that, contrary to what happens at the input, at the output not all valid scenarios in accordance with the worst ca ...
This paper introduces an algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP), based on the matching pursuit approach (MP). This algorithm decomposes the signal into a linear combination of selected atoms, chosen to ...
In this work, we address the numerical solution of fluid-structure interaction problems. This issue is particularly difficulty to tackle when the fluid and the solid densities are of the same order, for instance as it happens in hemodynamic applications, s ...
In this paper we present a method for the numerical solution of elliptic problems with multi-scale data using multiple levels of not necessarily nested grids. The method consists in calculating successive corrections to the solution in patches whose discre ...
We present a new contour segmentation method for femoral head detection in CT images. The principal idea underlying our approach is to represent the contour using active rays. Each ray has internal energy (continuity and smoothness constraints), as well as ...