Publications related to Vectors in a box

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

Network Formulations of Mixed-Integer Programs

Friedrich Eisenbrand, Marco Di Summa

We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of ...

INFORMS2009

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

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Friedrich Eisenbrand, Gennady Shmonin

This mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task co ...

2006

On the complexity of integer programming in fixed dimension

Friedrich Eisenbrand

Summary form only given. Integer programming is the problem of maximizing a linear function over the integer vectors which satisfy a given set of inequalities. A wide range of combinatorial optimization problems can be modeled as integer programming proble ...

2005

A linear algorithm for integer programming in the plane

Friedrich Eisenbrand

We show that a 2-variable integer program, defined by m constraints involving coefficients with at most φ bits, can be solved with O(m+φ) arithmetic operations on rational numbers of size O(φ). © Springer-Verlag 2004. ...

2005

Hard equality constrained integer knapsacks

Arjen Lenstra

We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...

2004

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Jean-Yves Le Boudec

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...

2002

Vectors in a box

Graph Chatbot

Chat with Graph Search

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Network Formulations of Mixed-Integer Programs

Multiple Object Tracking using Flow Linear Programming

Multiple Object Tracking using Flow Linear Programming

Parametric integer programming in fixed dimension

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

On the complexity of integer programming in fixed dimension

A linear algorithm for integer programming in the plane

Hard equality constrained integer knapsacks

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Network Formulations of Mixed-Integer Programs

Mapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality

Multiple Object Tracking using Flow Linear Programming

Parametric integer programming in fixed dimension

On the complexity of integer programming in fixed dimension

A linear algorithm for integer programming in the plane

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Multiple Object Tracking using Flow Linear Programming

Hard equality constrained integer knapsacks