Sciweavers

106 search results - page 11 / 22
» Advisors for Incremental Propagation
Sort
View
ESOP
2004
Springer
14 years 1 months ago
From Constraints to Finite Automata to Filtering Algorithms
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...
Mats Carlsson, Nicolas Beldiceanu
AIPS
1994
13 years 9 months ago
Managing Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Roberto Cervoni, Amedeo Cesta, Angelo Oddi
AAAI
2008
13 years 10 months ago
Loop Calculus for Satisfiability
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...
Lukas Kroc, Michael Chertkov
AAAI
1997
13 years 9 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
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...
Rahul Roy-Chowdhury, Mukesh Dalal
SMC
2010
IEEE
132views Control Systems» more  SMC 2010»
13 years 6 months ago
Selection of SIFT feature points for scene description in robot vision
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...
Yuya Utsumi, Masahiro Tsukada, Hirokazu Madokoro, ...