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.
This paper is concerned with the mathematical characterization and wavelet analysis of self-similar random vector fields. The study consists of two main parts: the construction of random vector models on the basis of their invariance under coordinate trans ...
Of all modes of transport, transport by road is the most dangerous and the most costly in terms of human lives, according to Road Safety Action Program (2003-2010). In Europe, the 2010 road safety target of halving the number of road fatalities by 2010 see ...
In this paper we define a scale-space for cortical mean curvature maps on the sphere, that offers a hierarchical representation of the cortical structures, useful in multi-scale algorithms. A spherical feature map is obtained through inflation of the corti ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ℓ1 minimisation. The problem is to identify a dictionary \dico from a set of training samples \Y knowing that \Y=\dico\X ...
Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this paper, a new ...
A method is proposed to robabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been th ...
Clustering similar documents is a difficult task for text data mining. Difficulties stem especially from the way documents are translated into numerical vectors. In this chapter, we will present a method that uses Self Organizing Map (SOM) to cluster medic ...
At the heart of feature integration theory is a master map which operates on dimension-based feature maps. It is assumed that these feature maps are organized retinotopically. If in conjunction search, for example, a horizontal green line has to be searche ...
In this paper, we discuss an important problem of the selection of the neighborhood radius in the learning schemes of the Winner Takes Most Kohonen neural network. The optimization of this parameter is essential in case of hardware realization of the netwo ...
A new programmable neighborhood mechanism for the Winner Takes Most (WTM) self-organizing Kohonen map has been proposed in this paper. Described circuit is an asynchronous solution, which does not require the controlling clock generator. The winning neuron ...