Concept

Théorème d'approximation de Dirichlet

Publications associées (57)

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

Simultaneous Approximation of Polynomials

János Pach, Andrei Kupavskii

Let P-d denote the family of all polynomials of degree at most d in one variable x, with real coefficients. A sequence of positive numbers x(1)

Springer Int Publishing Ag2016

Exact simulation of max-stable processes

Sebastian Engelke, Clément Dombry

Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes their simulation difficult. Algorithms based on finite approximations are o ...

Oxford University Press2016

APPROXIMATING k-MEDIAN VIA PSEUDO-APPROXIMATION

Ola Nils Anders Svensson

We present a novel approximation algorithm for k-median that achieves an approximation guarantee of 1 + root 3 + epsilon, improving upon the decade-old ratio of 3 + epsilon. Our improved approximation ratio is achieved by exploiting the power of pseudo-app ...

Siam Publications2016

On the configuration LP for maximum budgeted allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer Heidelberg2015

Effective-surface-energy approach for size effects in ferroics

Nava Setter, Alexander Tagantsev, Jin Wang

We present a simple approach enabling analytical treatments of size effects in ferroelectric samples of complicated shapes for the cases where long-range depolarizing effects are not involved. The key element of the approach is the presentation of the ener ...

American Physical Society2015

Approximation theorems in metric spaces and functionals strictly subordinated to convergent series

Some new results are presented concerning the search and approximation of solutions of equations in metric spaces using functionals strictly subordinated to a convergent series and functionals compatible with a convergent series. These classes of functiona ...

Elsevier2014

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

Recovering Neugebauer colorant reflectances and Ink-spreading curves from printed color images

Roger Hersch, Thomas Bugnon

Spectral reflection prediction models, although effective, are impractical for certain industrial applications such as self-calibrating devices and online monitoring because their calibration requires specific color-constant calibration patches. Using the ...

Wiley-Blackwell2014

On the finite section method for computing exponentials of doubly-infinite skew-Hermitian matrices

Meiyue Shao

Computing the exponential of large-scale skew-Hermitian matrices or parts thereof is frequently required in applications. In this work, we consider the task of extracting finite diagonal blocks from a doubly-infinite skew-Hermitian matrix. These matrices u ...

Elsevier Science Inc2014

On the Configuration LP for Maximum Budgeted Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer2014