Concept

Moyenne arithmético-géométrique

Publications associées (41)

Aerosol optical absorption coefficients at seven wavelengths in 10 min resolution measured in the Swiss container during MOSAiC 2019/2020

Julia Schmale, Ivo Fabio Beck, Benjamin Jérémy Laurent Heutte, Lubna Dada

This dataset contains aerosol optical absorption coefficients at seven different wavelengths (babs(λ)), averaged to 10 min time resolution, measured during the year-long MOSAiC expedition from October 2019 to September 2020. The measurements were performed ...

EPFL Infoscience2023

Equivalent black carbon concentration in 10 minutes time resolution, measured in the Swiss container during MOSAiC 2019/2020

Julia Schmale, Ivo Fabio Beck, Benjamin Jérémy Laurent Heutte, Lubna Dada

This dataset contains equivalent black carbon (eBC) concentrations, averaged to 10 min time resolution, measured during the year-long MOSAiC expedition from October 2019 to September 2020. The measurements were performed in the Swiss container on the D-dec ...

Pangaea2022

Grassmannian diffusion maps based surrogate modeling via geometric harmonics

A novel surrogate model based on the Grassmannian diffusion maps (GDMaps) and utilizing geometric harmonics (GH) is developed for predicting the response of complex physical phenomena. The method utilizes GDMaps to obtain a low-dimensional representation o ...

2022

Efficient geometric integrators for the linear and nonlinear time-dependent Schrödinger equation

Julien Roulet

Many physical and chemical reactions are driven by nonadiabatic processes, which imply the breakdown of the celebrated Born-Oppenheimer approximation. To understand these processes, experimentalists employ spectroscopic techniques. However, the obtained re ...

EPFL2022

From Trees to Barcodes and Back Again:A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...

EPFL2022

Robots' Motion Planning in Human Crowds by Acceleration Obstacles

Aude Billard, Diego Felipe Paez Granados, David Julian Gonon

We study the Acceleration Obstacle (AO) as a concept to enable a robot's navigation in human crowds. The AO's geometric properties are analyzed and a direct sampling-free algorithm is proposed to approximate its boundary by linear constraints. The resultin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Wasserstein Adversarial Regularization for learning with label noise

Devis Tuia, Sylvain Lobry, Nicolas Courty

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose ...

2021

An implicit split-operator algorithm for the nonlinear time-dependent Schrödinger equation

Jiri Vanicek, Julien Roulet

The explicit split-operator algorithm is often used for solving the linear and nonlinear time-dependent Schrödinger equations. However, when applied to certain nonlinear time-dependent Schrödinger equations, this algorithm loses time reversibility and seco ...

2021

Kernel Density Estimation through Density Constrained Near Neighbor Search

Mikhail Kapralov, Navid Nouri

In this paper we revisit the kernel density estimation problem: given a kernel K(x, y) and a dataset of n points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query q, a (1 + epsilon)-approximation to mu := ...

IEEE2020

Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration

Assyr Abdulle, Giacomo Garegnani

A novel probabilistic numerical method for quantifying the uncertainty induced by the time integration of ordinary differential equations (ODEs) is introduced. Departing from the classical strategy to randomize ODE solvers by adding a random forcing term, ...

2020

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