Sciweavers

214 search results - page 13 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 2 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
TAP
2010
Springer
126views Hardware» more  TAP 2010»
14 years 21 days ago
DyGen: Automatic Generation of High-Coverage Tests via Mining Gigabytes of Dynamic Traces
Unit tests of object-oriented code exercise particular sequences of method calls. A key problem when automatically generating unit tests that achieve high structural code coverage ...
Suresh Thummalapenta, Jonathan de Halleux, Nikolai...
ICASSP
2011
IEEE
12 years 11 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
ICALP
1990
Springer
13 years 11 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick