10 search results - page 1 / 2 » The Computational Complexity of Dominance and Consistency in... |
JAIR
2008
13 years 5 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
HPCA
1996
IEEE
13 years 9 months ago
1996
IEEE
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
CGF
2006
13 years 5 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a change detection method resistant to global and local illumination variations for use in visual surveillance scenarios. Approaches designed thus far for robustness to...
CRYPTO
2012
Springer
11 years 7 months ago
2012
Springer
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...