315 search results - page 14 / 63 » Eigenvalue bounds for independent sets |
CPAIOR
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
ICML
2005
IEEE
15 years 12 months ago
2005
IEEE
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
AINA
2010
IEEE
15 years 3 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
103
click to vote
DCOSS
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...