145 search results - page 15 / 29 » Strong Colorings of Hypergraphs |
102
click to vote
TAMC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
105
click to vote
JCSS
2008
14 years 11 months ago
2008
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
115
click to vote
ATAL
2010
Springer
15 years 27 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a methodology for improved segmentation of images in a Bayesian framework by fusion of color, texture and gradient information. The proposed algorithm is initialized by...
111
click to vote
IEEEIA
2009
14 years 9 months ago
2009
Covert channel attacks utilize shared resources to indirectly transmit sensitive information to unauthorized parties. Current security mechanisms such as SELinux rely on tagging th...