Publications associées à Majorant ou minorant

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.

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Jian Li, Lingxiao Huang

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

Robust Maximization of Non-Submodular Objectives

Volkan Cevher, Ilija Bogunovic, Junyao Zhao

We study the problem of maximizing a monotone set function subject to a cardinality constraint k in the setting where some number of elements is deleted from the returned set. The focus of this work is on the worst-case adversarial setting. While there exi ...

2018

Content Based Status Updates

Emre Telatar, Elie Najm, Rajai Nasser

Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on ...

2018

Content Based Status Updates

Emre Telatar, Elie Najm, Rajai Nasser

IEEE2018

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

On sums of eigenvalues of elliptic operators on manifolds

Joachim Stubbe

We use the averaged variational principle introduced in a recent article on graph spectra [10] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of Kroger's bound ...

European Mathematical Soc2017

Ambiguous Joint Chance Constraints under Mean and Dispersion Information

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We study joint chance constraints where the distribution of the uncertain parameters is only known to belong to an ambiguity set characterized by the mean and support of the uncertainties and by an upper bound on their dispersion. This setting gives rise t ...

Informs2017

A feasible-side globally convergent modifier-adaptation scheme

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti

In the context of static real-time optimization (RTO) of uncertain plants, the standard modifier-adaptation scheme consists in adding first-order correction terms to the cost and constraint functions of a model based optimization problem. If the algorithm ...

Elsevier Sci Ltd2017

Majorant ou minorant

Graph Chatbot

Chattez avec Graph Search

Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Robust Maximization of Non-Submodular Objectives

Content Based Status Updates

Content Based Status Updates

Extension complexity of stable set polytopes of bipartite graphs

On sums of eigenvalues of elliptic operators on manifolds

Ambiguous Joint Chance Constraints under Mean and Dispersion Information

Rich Vehicle and Inventory Routing Problems with Stochastic Demands

A feasible-side globally convergent modifier-adaptation scheme

On sums of eigenvalues of elliptic operators on manifolds

Ambiguous Joint Chance Constraints under Mean and Dispersion Information

Rich Vehicle and Inventory Routing Problems with Stochastic Demands

A feasible-side globally convergent modifier-adaptation scheme

Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs

Content Based Status Updates

Robust Maximization of Non-Submodular Objectives

Extension complexity of stable set polytopes of bipartite graphs

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Content Based Status Updates