1651 search results - page 28 / 331 » Measuring the Complexity of Classification Problems |
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
Classifier combination is a powerful strategy to support useful solutions in difficult classification problems. Notwithstanding, the effectiveness of a multi-classifier system str...
ESANN
2006
13 years 9 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
CORR
2009
Springer
13 years 5 months ago
2009
Springer
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their g...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...