Sciweavers

26 search results - page 1 / 6
» Feasible and Accurate Algorithms for Covering Semidefinite P...
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 2 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
ICCV
2003
IEEE
14 years 6 months ago
Camera calibration using spheres: A semi-definite programming approach
Vision algorithms utilizing camera networks with a common field of view are becoming increasingly feasible and important. Calibration of such camera networks is a challenging and ...
Motilal Agrawal, Larry S. Davis
SIAMJO
2010
100views more  SIAMJO 2010»
12 years 11 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
FOCS
2005
IEEE
13 years 10 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
VSTTE
2012
Springer
11 years 12 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...