Sciweavers

1772 search results - page 12 / 355
» Classifying Problems into Complexity Classes
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
ICML
2008
IEEE
14 years 8 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
ICML
2001
IEEE
14 years 8 months ago
Round Robin Rule Learning
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...
Johannes Fürnkranz
MFCS
2009
Springer
14 years 2 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He
PRL
2006
78views more  PRL 2006»
13 years 7 months ago
The interaction between classification and reject performance for distance-based reject-option classifiers
Consider the class of problems in which a target class is well-defined, and an outlier class is ill-defined. In these cases new outlier classes can appear, or the class-conditiona...
Thomas Landgrebe, David M. J. Tax, Pavel Pacl&iacu...