177 search results - page 14 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...
SIAMJO
2010
13 years 3 months ago
2010
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 ...
JMLR
2006
13 years 9 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...