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.
Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this topolog ...
In a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations, the construction of lower bounds for the coercivity and inf-sup stability constants is essential. In [Huynh et al., C. R. Acad. Sci. Par ...
In this paper we consider reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized linear and non-linear parabolic partial differential equations. The essential ingredients are Galerkin projection ...
In this paper we deal with reduced basis techniques applied to Stokes equations. We consider domains with different shape, parametrized by affine and non-affine maps with respect to a reference domain. The proposed method is ideally suited for the repeated ...
We propose a framework for 3D geometry processing that provides direct access to surface curvature to facilitate advanced shape editing, filtering, and synthesis algorithms. The central idea is to map a given surface to the curvature domain by evaluating i ...
In this paper we consider (hierarchical, Lagrange) reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial differential equations. The essential ingredients are (primal- ...
We present an approach to the construction of lower bounds for the coercivity and inf–sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. The method, based ...
We introduce a new discretization scheme for Maxwell equations in two space dimension. Inspired by the new paradigm of Isogeometric analysis introduced in Hughes et al. (2005) [16], we propose an algorithm based on the use of bivariate B-splines spaces sui ...
This work deals with coding systems based on sparse graph codes. The key issue we address is the relationship between iterative (in particular belief propagation) and maximum a posteriori decoding. We show that between the two there is a fundamental connec ...
In a distributed application, high-availability of a critical online service is ensured despite failures by duplicating the vital components of the server. Whilst guaranteeing the access to the server at all times, duplication requires particular care, so ...
