Sciweavers

1772 search results - page 31 / 355
» Classifying Problems into Complexity Classes
Sort
View
INFORMATICALT
2000
118views more  INFORMATICALT 2000»
13 years 7 months ago
Generalization Error of Randomized Linear Zero Empirical Error Classifier: Simple Asymptotics for Centered Data Case
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
Valdas Diciunas, Sarunas Raudys
CVPR
2004
IEEE
14 years 9 months ago
Learning Classifiers from Imbalanced Data Based on Biased Minimax Probability Machine
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
ENDM
2006
96views more  ENDM 2006»
13 years 7 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ITSSA
2006
89views more  ITSSA 2006»
13 years 7 months ago
A Methodology for Classifying Self-Organizing Software Systems
: The software industry is faced with the fast growing complexity of IT infrastructures. This makes manual administration increasingly difficult and appears to be the limiting fact...
Klaus Herrmann, Matthias Werner, Gero Mühl
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 5 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang