1772 search results - page 61 / 355 » Classifying Problems into Complexity Classes |
104
click to vote
ICTAI
2009
IEEE
15 years 7 months ago
2009
IEEE
Text classification categories Web documents in large collections into predefined classes based on their contents. Unfortunately, the classification process can be time-consumi...
113
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
105
click to vote
ECML
2004
Springer
15 years 4 months ago
2004
Springer
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...
209
Voted
GCB
2010
Springer
14 years 10 months ago
2010
Springer
: Despite recent advances in DNA chip technology current microarray gene expression studies are still affected by high noise levels, small sample sizes and large numbers of uninfor...
127
click to vote
JMLR
2002
15 years 5 days ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...