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.
This article approaches the incremental view maintenance problem from an algebraic perspective. The algebraic structure of a ring of databases is constructed and extended to form a powerful aggregate query calculus. The query calculus inherits the key prop ...
We derive a new upper bound on the diameter of a polyhedron , where . The bound is polynomial in and the largest absolute value of a sub-determinant of , denoted by . More precisely, we show that the diameter of is bounded by . If is bounded, then we show ...
In this article we introduce the notion of emphmulti-Koszul algebra for the case of a locally finite dimensional nonnegatively graded connected algebra, as a generalization of the notion of (generalized) Koszul algebras defined by R. Berger for homogeneous ...
We study the single-phase flow in a saturated, bounded heterogeneous porous medium. We model the permeability as a log-normal random field. We perform a perturbation analysis, expanding the solution in Taylor series. The series is directly computable in th ...
In this work we consider the random discrete L2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. ...
To achieve an optimal outcome in many situations, agents need to choose distinct actions from one another. This is the case notably in many resource allocation problems, where a single resource can only be used by one agent at a time. How shall a designer ...
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional rela ...
The Letter proposes a method for phase estimation from a fringe pattern. The proposed method relies on a parametric approach where the phase is locally approximated as a two-dimensional (2D) polynomial, with the ensuing polynomial coefficients as the respe ...
The paper introduces a multiple signal classification technique based method for fringe analysis. In the proposed method, the phase of a fringe pattern is locally approximated as a polynomial. The polynomial phase signal is then transformed to obtain signa ...
Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...
