Sciweavers

351 search results - page 13 / 71
» Perfect Constraints Are Tractable
Sort
View
AAAI
2008
13 years 10 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...
JCDCG
1998
Springer
13 years 12 months ago
Radial Perfect Partitions of Convex Sets in the Plane
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...
Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Na...
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Doubly Perfect Nonlinear Boolean Permutations
Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secretkey block ciphers. This choice directly induces the cl...
Laurent Poinsot
AMC
2006
116views more  AMC 2006»
13 years 7 months ago
An algebraic construction of orthonormal M-band wavelets with perfect reconstruction
This paper presents an algebraic approach to construct M-band orthonormal wavelet bases with perfect reconstruction. We first derive the system of constraint equations of M-band f...
Tony Lin, Shufang Xu, Qingyun Shi, Pengwei Hao
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 1 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx