1772 search results - page 59 / 355 » Classifying Problems into Complexity Classes |
CSE
2008
IEEE
15 years 2 months ago
2008
IEEE
Classification using association rules has added a new dimension to the ongoing research for accurate classifiers. Over the years, a number of associative classifiers based on pos...
78
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Learning a discriminant becomes substantially more difficult when the datasets are high-dimensional and the available samples are few. This is often the case in computer vision an...
106
Voted
NIPS
2001
15 years 1 months ago
2001
In many scientific and engineering applications, detecting and understanding differences between two groups of examples can be reduced to a classical problem of training a classif...
107
click to vote
AAAI
1998
15 years 1 months ago
1998
In many important text classification problems, acquiring class labels for training documents is costly, while gathering large quantities of unlabeled data is cheap. This paper sh...
96
Voted
MST
2008
15 years 14 days ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...