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.

Fixed-structure H-2 controller design for polytopic systems via LMIs

Alireza Karimi, Arash Sadeghzadeh

In this paper a new approach for fixed-structure H2 controller design in terms of solutions to a set of linear matrix inequalities are given. Both discrete- and continuous-time single-input single-output (SISO) time- invariant systems are considered. Then ...

Wiley-Blackwell2015

Double-Normal Pairs In Space

János Pach

A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...

London Mathematical Society, Cambridge2015

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

Quantization Design for Unconstrained Distributed Optimization

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

We consider an unconstrained distributed optimization problem and assume that the bit rate of the communication in the network is limited. We propose a distributed optimization algorithm with an iteratively refining quantization design, which bounds the qu ...

2015

Lyapunov exponents of random walks in small random potential: the upper bound

Thomas Mountford, Jean-Christophe Mourrat

We consider the simple random walk on Z(d) evolving in a random i.i.d. potential taking values in [0, +infinity). The potential is not assumed integrable, and can be rescaled by a multiplicative factor lambda > 0. Completing the work started in a companion ...

Univ Washington, Dept Mathematics2015

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014

On Sub-determinants and the Diameter of Polyhedra

Friedrich Eisenbrand, Martin Niemeier, Marco Di Summa, Nicolas Bonifas

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 ...

Springer2014

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

A note on coloring line arrangements

János Pach, Rom Pinchasi

We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...

Electronic Journal Of Combinatorics2014

Majorant ou minorant

Graph Chatbot

Chattez avec Graph Search

Fixed-structure H-2 controller design for polytopic systems via LMIs

Double-Normal Pairs In Space

On the configuration LP for maximum budgeted allocation

Quantization Design for Unconstrained Distributed Optimization

Lyapunov exponents of random walks in small random potential: the upper bound

Fundamental aspects of linear slow light systems

On the DCJ Median Problem

On Sub-determinants and the Diameter of Polyhedra

Right-Protected Data Publishing with Provable Distance-Based Mining

A note on coloring line arrangements

On the DCJ Median Problem

Double-Normal Pairs In Space

Lyapunov exponents of random walks in small random potential: the upper bound

Fixed-structure H-2 controller design for polytopic systems via LMIs

Fundamental aspects of linear slow light systems

On the configuration LP for maximum budgeted allocation

Quantization Design for Unconstrained Distributed Optimization

On Sub-determinants and the Diameter of Polyhedra

Right-Protected Data Publishing with Provable Distance-Based Mining

A note on coloring line arrangements