1772 search results - page 10 / 355 » Classifying Problems into Complexity Classes |
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
CCIA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
PRL
2006
13 years 7 months ago
2006
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...