Sciweavers

239 search results - page 6 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
ICCV
2011
IEEE
12 years 7 months ago
Are Spatial and Global Constraints Really Necessary for Segmentation?
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
Aurelien Lucchi, Yunpeng Li, Xavier Boix, Kevin Sm...
CPAIOR
2006
Springer
13 years 11 months ago
Improved Algorithm for the Soft Global Cardinality Constraint
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
Alessandro Zanarini, Michela Milano, Gilles Pesant
DKE
2007
101views more  DKE 2007»
13 years 7 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
DAC
1998
ACM
13 years 11 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong