Publications related to A totally unimodular view of structured sparsity

Fixed-order H-infinity controller design for systems with ellipsoidal parametric uncertainty

In this paper, fixed-order robust H-infinity controller design for systems with ellipsoidal parametric uncertainty based on parameter dependent Lyapunov functions is studied. Using the concept of Strictly Positive Realness (SPRness) of transfer functions, ...

Taylor & Francis2011

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achie ...

2010

Minimizing the sum of weighted completion times in a concurrent open shop

Ola Nils Anders Svensson

We study minimizing the sum of weighted completion times in a concurrent open shop. We give a primaldual 2-approximation algorithm for this problem. We also show that several natural linear programming relaxations for this problem have an integrality gap o ...

2010

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

2009

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individ- ual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in pre ...

Idiap2009

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

Compressive Sensing For Sensor Calibration

Volkan Cevher

We consider a calibration problem, where we determine an unknown sensor location using the known track of a calibration target and a known reference sensor location. We cast the calibration problem as a sparse approximation problem where the unknown sensor ...

2008

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. Our work improves the previously best known (0. ...

Springer2007

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...

2007

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

A totally unimodular view of structured sparsity

Graph Chatbot

Chat with Graph Search

Fixed-order H-infinity controller design for systems with ellipsoidal parametric uncertainty

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Minimizing the sum of weighted completion times in a concurrent open shop

Multiple Object Tracking using Flow Linear Programming

Multiple Object Tracking using Flow Linear Programming

Parametric integer programming in fixed dimension

Compressive Sensing For Sensor Calibration

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Average case analysis of multichannel sparse approximations using p- thresholding

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Minimizing the sum of weighted completion times in a concurrent open shop

Compressive Sensing For Sensor Calibration

Fixed-order H-infinity controller design for systems with ellipsoidal parametric uncertainty

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

Multiple Object Tracking using Flow Linear Programming

Multiple Object Tracking using Flow Linear Programming

Parametric integer programming in fixed dimension

Average case analysis of multichannel sparse approximations using p- thresholding

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X