46 search results - page 5 / 10 » On linear and semidefinite programming relaxations for hyper... |
PAMI
2007
14 years 9 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
81
Voted
EMMCVPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
97
Voted
TIT
2011
14 years 4 months ago
2011
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
148
Voted
DC
2011
13 years 9 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...