Concept

Mehler kernel

Publications associées (13)

Ultrafast Transverse Modulation of Free Electrons by Interaction with Shaped Optical Fields

Fabrizio Carbone, Alexey Sapozhnik, Phoebe Marie Tengdin, Giovanni Maria Vanacore, Ivan Madan, Ido Kaminer, Simone Gargiulo, Francesco Barantani, Veronica Leccese

Spatiotemporal electron-beam shaping is a bold frontier of electron microscopy. Over the past decade, shaping methods evolved from static phase plates to low-speed electrostatic and magnetostatic displays. Recently, a swift change of paradigm utilizing lig ...

AMER CHEMICAL SOC2022

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Amir Zandieh

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

EPFL2020

Slepian Guided Filtering of Graph Signals

Dimitri Nestor Alice Van De Ville, Miljan Petrovic

Joint localization of graph signals in vertex and spectral domain is achieved in Slepian vectors calculated by either maximizing energy concentration (mu) or minimizing modified embedded distance (xi) in the subgraph of interest. On the other hand, graph L ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Kantorovich distance in the martingale CLT and quantitative homogenization of parabolic equations with random coefficients

Jean-Christophe Mourrat

The article begins with a quantitative version of the martingale central limit theorem, in terms of the Kantorovich distance. This result is then used in the study of the homogenization of discrete parabolic equations with random i.i.d. coefficients. For s ...

Springer Heidelberg2014

Aspects of Linear Landau Damping in Discretized Systems

Stephan Brunner

Basic linear eigenmode spectra for electrostatic Langmuir waves and drift-kinetic slab ion temperature gradient modes are examined in a series of scenarios. Collisions are modeled via a Lenard-Bernstein collision operator which fundamentally alters the lin ...

American Institute of Physics2013

A Probabilistic Approach of Sum Rules for Heat Polynomials

Olivier Lévêque

In this paper, we show that the sum rules for generalized Hermite polynomials derived by Daboul and Mizrahi (2005 J. Phys. A: Math. Gen. 38 427-48) and by Graczyk and Nowak (2004 C. R. Acad. Sci., Ser. 1 338 849) can be interpreted and easily recovered usi ...

2012

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Fabio Nobile

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions th ...

MATHICSE2012

Sparse spectral approximations for computing polynomial functionals

Fabio Nobile

2012

Fast O(1) Bilateral Filtering Using Trigonometric Range Kernels

Michaël Unser, Daniel Sage, Kunal Narayan Chaudhury

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011

A Computable Fourier Condition Generating Alias-Free Sampling Lattices

Yue Lu, Minh Do

We propose a Fourier analytical condition linking alias-free sampling with the Fourier transform of the indicator function defined on the given frequency support. Our discussions center around how to develop practical computation algorithms based on the pr ...

Institute of Electrical and Electronics Engineers2009

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