177 search results - page 15 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
ESWS
2011
Springer
13 years 20 days ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
MLG
2007
Springer
14 years 3 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...