Concept

Argument de la diagonale de Cantor

Publications associées (11)

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

Graph-based approximate message passing iterations

Raphaël Jean Berthier

Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing ...

OXFORD UNIV PRESS2023

Testing For The Rank Of A Covariance Operator

Victor Panaretos

How can we discern whether the covariance operator of a stochastic pro-cess is of reduced rank, and if so, what its precise rank is? And how can we do so at a given level of confidence? This question is central to a great deal of methods for functional dat ...

INST MATHEMATICAL STATISTICS-IMS2022

A logarithmic epiperimetric inequality for the obstacle problem

Maria Colombo

We study the regularity of the regular and of the singular set of the obstacle problem in any dimension. Our approach is related to the epiperimetric inequality of Weiss (Invent Math 138:23-50, Wei99a), which works at regular points and provides an alterna ...

2018

A reduced basis hybrid method for the coupling of parametrized domains represented by fluidic networks

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...

Elsevier2012

Gravity Solitary Waves By Minimization: An Uncountable Family

Boris Buffoni

We improve and simplify the minimization method for solitary waves in two cases: firstly, when the surface tension is weak (that is, the Bond number is < 1/3) and the depth is finite, and secondly, when the depth is infinite. In a previous work on the firs ...

2009

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

Institute of Electrical and Electronics Engineers2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

2005

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...

2002