Sciweavers

453 search results - page 55 / 91
» Tight bounds for the partial-sums problem
Sort
View
CVPR
2008
IEEE
16 years 2 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
ICCV
2007
IEEE
16 years 2 months ago
Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
90
Voted
MOR
2010
118views more  MOR 2010»
14 years 11 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
90
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 23 days ago
Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapak...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 2 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...