Concept

Série convergente

Publications associées (26)

Computational Studies for the Design of Metalloenzyme Mimics

At present, there is no general standard automated method for engineering metalloenzymes, industrially-relevant systems able to catalyze environmentally friendly reactions. One of the most studied natural metalloenzymes is the second isoform of human carbo ...

EPFL2023

Over-the-Air Computation via Reconfigurable Intelligent Surface

Yuning Jiang, Wei Chen

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Convergence without Convexity: Sampling, Optimization, and Games

Ya-Ping Hsieh

Many important problems in contemporary machine learning involve solving highly non- convex problems in sampling, optimization, or games. The absence of convexity poses significant challenges to convergence analysis of most training algorithms, and in some ...

EPFL2020

Agito ergo sum: Correlates of spatio-temporal motion characteristics during fMRI

Dimitri Nestor Alice Van De Ville, Thomas William Arthur Bolton

The impact of in-scanner motion on functional magnetic resonance imaging (fMRI) data has a notorious reputation in the neuroimaging community. State-of-the-art guidelines advise to scrub out excessively corrupted frames as assessed by a composite framewise ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Expectation propagation in the large data limit

Guillaume Philippe Ivan Joseph Dehaene

Expectation propagation (EP) is a widely successful algorithm for variational inference. EP is an iterative algorithm used to approximate complicated distributions, typically to find a Gaussian approximation of posterior distributions. In many applications ...

Wiley2018

Convergence Analysis and Criterion for Data Assimilation with Sensitivities from Monte Carlo Neutron Transport Codes

Andreas Pautz, Mathieu Hursin, Daniel Jerôme Siefman

Sensitivity coefficients calculated with Monte Carlo neutron transport codes are subject to statistical fluctuations. The fluctuations affect parameters that are calculated with the sensitivity coefficients. The convergence study presented here describes t ...

ANS2018

Monotonic Prefix Consistency in Distributed Systems

Rachid Guerraoui, Dragos-Adrian Seredinschi, Jad Hamza

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are alwa ...

2018

CARTHA / The Form of Form / Issue I / How to Learn Better

Dieter Dietz, Daniel Zamarbide Elizondo

CARTHA is a curated platform that focuses on sharing different forms of critical thinking regarding architecture and society. Through opinions, experiences and works, CARTHA aims to map out the contemporary architectural landscape. How to Learn Better inau ...

2016

Real-Time Optimization Based on Adaptation of Surrogate Models

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Martand Singhal

Recently, different real-time optimization (RTO) schemes that guarantee feasibility of all RTO iterates and monotonic convergence to the optimal plant operating point have been proposed. However, simulations reveal that these schemes converge very slowly t ...

Elsevier Science Bv2016

Accurate, Stable and Efficient Modal Calculations of Photoelectrically Useful Absorption in Lamellar Metallic and Semiconductor Diffraction Gratings

David Isaak Gablinger

Solar energy has seen tremendous advances in the past years. For thin film photovoltaics, which use less of the expensive semiconductor materials, insufficient light absorption can be a limiting factor. It is hoped that by using diffractive optics to impro ...

EPFL2016

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