Sciweavers

SIAMJO
2008
66views more  SIAMJO 2008»
14 years 12 days ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
JMLR
2006
124views more  JMLR 2006»
14 years 14 days ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini