1772 search results - page 78 / 355 » Classifying Problems into Complexity Classes |
COLT
2008
Springer
15 years 4 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
116
click to vote
STACS
1993
Springer
15 years 6 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
EWCBR
2008
Springer
15 years 4 months ago
2008
Springer
We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the casefeature matrix. We pr...
113
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
134
click to vote
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...