Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Loop Calculus, introduced by Chertkov and Chernyak, is a new technique to incrementally improve approximations computed by Loopy Belief Propagation (LBP), with the ability to even...
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
This paper presents a method for selection of SIFT(Scale-Invariant Feature Transform) feature points using OC-SVM (One Class-Support Vector Machines). We proposed the method for au...