6142 search results - page 11 / 1229 » The Complexity of Partition Functions |
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
CHI
2008
ACM
14 years 7 months ago
2008
ACM
Coarse-grained approaches to customization allow the user to enable or disable groups of features at once, rather than individual features. While this may reduce the complexity of...
COCOON
2005
Springer
14 years 28 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
IJCAI
2007
13 years 8 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
CONSTRAINTS
2008
13 years 7 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...