226 search results - page 26 / 46 » GAC on Conjunctions of Constraints |
RANDOM
2001
Springer
13 years 12 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
JSAC
2006
13 years 7 months ago
2006
We propose a simple pulse-amplitude modulation (PAM)-based coded modulation scheme that overcomes two major constraints of power line channels, viz., severe insertion-loss and impu...
VLSID
2002
IEEE
14 years 7 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ECCV
1996
Springer
14 years 9 months ago
1996
Springer
We present an algorithm which uses information from both surface reflectance and illumination variation to solve for colour constancy. Most colour constancy algorithms assume that ...