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 textbook is an introduction to Scientific Computing, in which several numerical methods for the computer solution of certain classes of mathematical problems are illustrated. The authors show how to compute the zeros or the integrals of continuous fun ...
We prove a general subconvex bound in the level aspect for Rankin–Selberg L-functions associated with two primitive holomorphic or Maass cusp forms over Q. We use this bound to establish the equidistribution of incomplete Galois orbits of Heegner points on ...
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomial or piecewise sinusoidal signals, and call the number of degrees of freedom ...
The purpose of this paper is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit with some structured dictionaries for ``simple'' functions in finite or infinite dimension. Our results are based on an extension of ...
A novel method for inverting time-resolved line-integrated interferometric plasma density measurements is described. The method uses singular value decomposition of local density profiles from Thomson scattering measurements obtained at low sampling rates ...
This paper presents two methods, based on the rational approximation of functions, for designing Gabor like IIR filters with reduced computational complexity. The performance of the designed filters is discussed and comparisons with other approaches are ma ...
By contrast, in this paper, we use temporal motion models based on Principal Component Analysis to formulate the tracking problem as one of minimizing differentiable objective functions. The differential structure of these functions is rich enough to yield ...
Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit ...
To describe complex fenestration systems such as novel solar blinds, new glazing or coating materials, daylight and sunlight-redirecting devices, a detailed description of their optical properties is needed, given by their Bidirectional Transmission (or Re ...
We study a class of hyperbolic stochastic partial di®erential equations in Euclidean space, that includes the wave equation and the telegraph equation, driven by Gaussian noise concentrated on a hyperplane. The noise is assumed to be white in time but spat ...