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.
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...
Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...
Generalizing and unifying prior results, we solve the subconvexity problem for the L-functions of GL(1) and GL(2) automorphic representations over a fixed number field, uniformly in all aspects. A novel feature of the present method is the softness of our ...
We address the free boundary problem that consists in finding the shape of a three dimensional glacier over a given period and under given climatic conditions. Glacier surface moves by sliding, internal shear and external exchange of mass. Ice is modelled ...
We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding ...
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-co ...
In this paper we address the issue of network cost efficiency for live streaming peer-to-peer systems. We formalize this as an optimization problem, which features a generic cost function. The latter is appropriate to capture not only ISP-specific link wei ...
We extend the standard boosting procedure to train a two-layer classifier dedicated to handwritten char- acter recognition. The scheme we propose relies on a hidden layer which extracts feature vectors on a fixed number of points of interest, and an output ...
Recent results have shown that interference alignment can achieve K/2 degrees of freedom in a K-user interference channel with time or frequency varying channel coefficients. For fixed number of users K, the number of degrees of freedom characterizes the a ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
There are indications that gravity is asymptotically safe. The Standard Model (SM) plus gravity could be valid up to arbitrarily high energies. Supposing that this is indeed the case and assuming that there are no intermediate energy scales between the Fer ...
