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.
In this paper we present a reconfigurable device which significantly improves the execution time of the most computational intensive functions of three of the most widely used face recognition algorithms; those tasks multiply very large dense matrices. The ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
In an article of 2003, Kulshammer, Olsson, and Robinson defined l-blocks for the symmetric groups, where l is an arbitrary integer, and proved that they satisfy an analogue of the Nakayama Conjecture. Inspired by this work and the definitions of generalize ...
We give a procedure for deriving certain bulk S-matrix elements from corresponding boundary correlators. These are computed in the plane-wave limit, via an explicit construction of certain boundary sources that give bulk wave packets. A critical role is pl ...
A recent method for robust fixed-order H-infinty controller design by convex optimization proposed in [1] is investigated in this paper for the tuning of multivariable controllers. Linear Time-Invariant Multi-Input Multi-Output (LTI-MIMO) systems represent ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ell1 minimisation, or more precisely the problem of identifying a dictionary dico from a set of training samples Y knowing that $ ...
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( ...
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 ...
The evaluation of colorimetric films for the detection of low concentrations of gaseous ammonia in a waveguide configuration is presented. They were composed of a pH indicator selective to NH3 embedded in a polymeric matrix and deposited on an optical wave ...
We propose an approximation framework for distributed target localization in sensor networks. We represent the unknown target positions on a location grid as a sparse vector, whose support encodes the multiple target locations. The location vector is linea ...
This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing an ...
