Sciweavers

476 search results - page 68 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
FC
2005
Springer
120views Cryptology» more  FC 2005»
15 years 3 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
JSAT
2006
109views more  JSAT 2006»
14 years 9 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
106
Voted
ICML
2008
IEEE
15 years 10 months ago
On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
COLT
2006
Springer
15 years 1 months ago
Maximum Entropy Distribution Estimation with Generalized Regularization
Abstract. We present a unified and complete account of maximum entropy distribution estimation subject to constraints represented by convex potential functions or, alternatively, b...
Miroslav Dudík, Robert E. Schapire
CVPR
2006
IEEE
15 years 3 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black