Publication

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Related publications (122)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Continuous Localization Using Sparsity Constraints for High-Density Super-Resolution Microscopy

Michaël Unser, Cédric René Jean Vonesch, Hagay Kirshner

Super-resolution localization microscopy relies on sparse activation of photo-switchable probes. Such activation, however, introduces limited temporal resolution. High-density imaging overcomes this limitation by allowing several neighboring probes to be a ...

IEEE2013

On the online track assignment problem

Benjamin Leroy-Beaulieu

This paper aims to start an analytical study of the computational complexity of some online We analyze the following problem. Consider a train station consisting of a set of parallel tracks. Each track can be approached from one side only or from both side ...

2012

Reduction strategies for shape dependent inverse problems in haemodynamics

Gianluigi Rozza, Andrea Manzoni, Toni Mikael Lassila

This work deals with the development and application of reduction strategies for real-time and many query problems arising in fluid dynamics, such as shape optimization, shape registration (reconstruction), and shape parametrization. The proposed strategy ...

Springer2012

Multistream speaker diarization of meetings recordings beyond MFCC and TDOA features

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

Many state-of-the-art diarization systems for meeting recordings are based on the HMM/GMM framework and the combination of spectral (MFCC) and time delay of arrivals (TDOA) features. This paper presents an extensive study on how multistream diarization can ...

2012

Stochastic Model Predictive Control: Controlling the Average Number of Constraint Violations

Colin Neil Jones, Milan Korda

This paper considers linear discrete-time systems with additive bounded disturbances subject to hard control input bounds and constraints on the expected number of state-constraint violations averaged over time, or, equivalently, constraints on the probabi ...

2012

COMMENT ON “MIXING BELIEFS AMONG INTERACTING AGENTS”

Jean-Yves Le Boudec, Javier Gomez Serrano

We comment on the derivation of the main equation in the bounded confidence model of opinion dynamics. In the original work, the equation is derived using an ad-hoc counting method. We point that the original derivation does contain some small mistake. The ...

World Scientific Publ Co Pte Ltd2012

Optimizing over the Growing Spectrahedron

Martin Jaggi

We devise a framework for computing an approximate solution path for an important class of parameterized semidefinite problems that is guaranteed to be ε-close to the exact solution path. The problem of computing the entire regularization path for matrix f ...

Springer Berlin Heidelberg2012

A Speculation-Friendly Binary Search Tree

Vincent Gramoli

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Assoc Computing Machinery2012

Strongly feasible stochastic model predictive control

Milan Korda

In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...

2011

Recipes on Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

Compressive sensing (CS) is a data acquisition and recovery technique for finding sparse solutions to linear inverse problems from sub-Nyquist measurements. CS features a wide range of computationally efficient and robust signal recovery methods, based on ...

2011