177 search results - page 13 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
TCS
2008
13 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
TSP
2010
13 years 3 months ago
2010
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
We address the problem of object detection and segmentation using holistic properties of object shape. Global shape representations are highly susceptible to clutter inevitably pr...