Sciweavers

68 search results - page 6 / 14
» Propagation algorithms for lexicographic ordering constraint...
Sort
View
CP
2004
Springer
15 years 3 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
ARTMED
2006
70views more  ARTMED 2006»
14 years 9 months ago
Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions, and periodic repetiti...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
ECCV
2008
Springer
15 years 11 months ago
Deformed Lattice Discovery Via Efficient Mean-Shift Belief Propagation
We introduce a novel framework for automatic detection of repeated patterns in real images. The novelty of our work is to formulate the extraction of an underlying deformed lattice...
Minwoo Park, Robert T. Collins, Yanxi Liu
CISSE
2008
Springer
14 years 11 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...