9 search results - page 2 / 2 » A combinatorial, primal-dual approach to semidefinite progra... |
IPCO
2008
13 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
JMLR
2006
13 years 6 months ago
2006
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...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
JCP
2006
13 years 6 months ago
2006
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...