Sciweavers

836 search results - page 5 / 168
» On the Complexity of Train Assignment Problems
Sort
View
PAMI
2008
155views more  PAMI 2008»
14 years 9 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
MFCS
2010
Springer
14 years 8 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
ICPR
2004
IEEE
15 years 10 months ago
Selective Sampling Based on the Variation in Label Assignments
In this paper, a new selective sampling method for the active learning framework is presented. Initially, a small training set ? and a large unlabeled set ? are given. The goal is...
Piotr Juszczak, Robert P. W. Duin
NIPS
1993
14 years 10 months ago
Credit Assignment through Time: Alternatives to Backpropagation
Learning to recognize or predict sequences using long-term context has many applications. However, practical and theoretical problems are found in training recurrent neural networ...
Yoshua Bengio, Paolo Frasconi
LICS
2009
IEEE
15 years 4 months ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx