1651 search results - page 125 / 331 » Measuring the Complexity of Classification Problems |
TSP
2010
13 years 2 months ago
2010
We address the problem in signal classification applications, such as automatic speech recognition (ASR) systems that employ the hidden Markov model (HMM), that it is necessary to...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Monitoring animals by the sounds they produce is an important and challenging task, whether the application is outdoors in a natural habitat, or in the controlled environment of a...
ESWA
2008
13 years 8 months ago
2008
In this paper a novel complex classifier architecture is proposed. The architecture has a hierarchical tree-like structure with simple artificial neural networks (ANNs) at each no...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...