Sciweavers

2914 search results - page 385 / 583
» Learning and Inference with Constraints
Sort
View
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
CP
2009
Springer
16 years 7 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
ICB
2009
Springer
412views Biometrics» more  ICB 2009»
16 years 1 months ago
Bayesian Face Recognition Based on Markov Random Field Modeling
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
Rui Wang, Zhen Lei, Meng Ao, Stan Z. Li
SAT
2009
Springer
132views Hardware» more  SAT 2009»
16 years 1 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
FC
2005
Springer
120views Cryptology» more  FC 2005»
16 years 2 days 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