728 search results - page 32 / 146 » Efficient Searching with Linear Constraints |
182
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
160
click to vote
PAMI
2007
15 years 5 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...
157
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
151
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
272
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Today's models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models ...