46 search results - page 6 / 10 » On linear and semidefinite programming relaxations for hyper... |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
TSP
2008
13 years 6 months ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
FOCS
2005
IEEE
14 years 9 days ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...