Concept

Fixed-point theorems in infinite-dimensional spaces

Publications associées (102)

Bootstrapping traceless symmetric O(N) scalars

Alessandro Vichi, Maria Refinetti, Marten Jan Reehorst

We use numerical bootstrap techniques to study correlation functions of traceless sym-metric tensors of O(N) with two indices ti j. We obtain upper bounds on operator dimen-sions for all the relevant representations and several values of N. We discover sev ...

SCIPOST FOUNDATION2023

Nonlocally-resonant metamaterials

Aleksi Antoine Bossart

In this thesis, we unveil a third design path to manipulate elastic waves within architected media, distinct from the traditional phononic crystal and locally-resonant metamaterial concepts. The core innovation lies in the concept of nonlocal resonances, d ...

EPFL2023

The Jordan property for local fundamental groups

Stefano Filipazzi, Roberto Svaldi

We show the Jordan property for regional fundamental groups of klt singularities of fixed dimension. Furthermore, we prove the existence of effective simultaneous index 1 covers for n-dimensional klt singularities. We give an application to the study of lo ...

2022

Wind farm layout and unconstrained hub height optimization using genetic algorithms applied to different power densities

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

LES and wind tunnel studies have shown significant benefit when allowing turbines (T) in a wind farm to adopt different heights. This work presents two new genetic algorithms (GA) that perform wind farm layout optimization (WFLO) involving continuous and t ...

2022

Spectral Coarse Spaces for the Substructured Parallel Schwarz Method

Tommaso Vanzan

The parallel Schwarz method (PSM) is an overlapping domain decomposition (DD) method to solve partial differential equations (PDEs). Similarly to classical nonoverlapping DD methods, the PSM admits a substructured formulation, that is, it can be formulated ...

2022

Application of optimal spline subspaces for the removal of spurious outliers in isogeometric discretizations

Espen Sande

We show that isogeometric Galerkin discretizations of eigenvalue problems related to the Laplace operator subject to any standard type of homogeneous boundary conditions have no outliers in certain optimal spline subspaces. Roughly speaking, these optimal ...

ELSEVIER SCIENCE SA2022

Visual Focus of Attention Estimation in 3D Scene with an Arbitrary Number of Targets

Jean-Marc Odobez, Rémy Alain Siegfried

Visual Focus of Attention (VFOA) estimation in conversation is challenging as it relies on difficult to estimate information (gaze) combined with scene features like target positions and other contextual information (speaking status) allowing to disambigua ...

IEEE COMPUTER SOC2021

Fourier Interpolation From Spheres

Martin Peter Stoller

In every dimension d >= 2, we give an explicit formula that expresses the values of any Schwartz function on R-d only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres whose radius is the square roo ...

AMER MATHEMATICAL SOC2021

Global bifurcation at isolated singular points of the Hadamard derivative

Charles Stuart

Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...

2021

Masksembles for Uncertainty Estimation

Pascal Fua, Pierre Bruno Baqué, Nikita Durasov, Timur Bagautdinov

Deep neural networks have amply demonstrated their prowess but estimating the reliability of their predictions remains challenging. Deep Ensembles are widely considered as being one of the best methods for generating uncertainty estimates but are very expe ...

2021

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