Sciweavers

17 search results - page 4 / 4
» Symmetry Breaking for Maximum Satisfiability
Sort
View
SPAA
2009
ACM
13 years 11 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
NIPS
2008
13 years 6 months ago
On the Reliability of Clustering Stability in the Large Sample Regime
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
Ohad Shamir, Naftali Tishby