2661 search results - page 204 / 533 » Quantum Complexity Classes |
124
Voted
ECCC
2006
15 years 3 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
124
Voted
CSB
2005
IEEE
15 years 9 months ago
2005
IEEE
In the feature selection of cancer classification problems, many existing methods consider genes individually by choosing the top genes which have the most significant signal-to...
142
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
135
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
Most image retrieval systems perform a linear search over the database to find the closest match to a query. However, databases usually exhibit a natural grouping structure into c...
122
Voted
ICML
2001
IEEE
16 years 4 months ago
2001
IEEE
In this paper, we discuss a technique for handling multi-class problems with binary classifiers, namely to learn one classifier for each pair of classes. Although this idea is kno...