CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
1
posts
with
325
views
325
views
Laura Leal-Taixé was born in Barcelona in 1984. She studied Telecommunications Engineering at the Technical University of Catalonia (UPC).
She went to Boston, USA in 2007 to d...
MICS
2008
13 years 2 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
SAC
2008
ACM
13 years 3 months ago
2008
ACM
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
MST
2007
13 years 4 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
MP
2007
13 years 4 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
SIAMJO
2002
13 years 4 months ago
2002
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
JCO
2000
13 years 4 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
INFORMATICALT
2000
13 years 4 months ago
2000
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. How...
COR
2004
13 years 4 months ago
2004
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...