Sciweavers

555 search results - page 58 / 111
» Decompositions of Grammar Constraints
Sort
View
CP
2010
Springer
14 years 11 months ago
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
117
Voted
BMVC
2010
14 years 7 months ago
Epipolar Constraints for Multiscale Matching
Many recent keypoint detectors associate a local scale (for multiscale detectors) or even a full affine frame (for affine-invariant detectors) to each detected keypoint. Although ...
Bill Triggs, Pashmina Bendale
AAAI
2008
15 years 3 months ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
BIRTHDAY
2008
Springer
15 years 2 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
94
Voted
KDID
2003
93views Database» more  KDID 2003»
15 years 2 months ago
A Framework for Frequent Sequence Mining under Generalized Regular Expression Constraints
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
Hunor Albert-Lorincz, Jean-François Boulica...