1772 search results - page 9 / 355 » Classifying Problems into Complexity Classes |
GPEM
2008
13 years 7 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
JMLR
2002
13 years 7 months ago
2002
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
ACCV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
MCS
2004
Springer
14 years 1 months ago
2004
Springer
The ECOC framework provides a powerful and popular method for solving multiclass problems using a multitude of binary classifiers. We had recently introduced the Binary Hierarchica...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...