211 search results - page 7 / 43 » Restricting the IDM for Classification |
ENDM
2010
13 years 7 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
JMLR
2002
13 years 7 months ago
2002
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
COLING
2010
13 years 2 months ago
2010
This paper presents a novel semisupervised learning algorithm called Active Deep Networks (ADN), to address the semi-supervised sentiment classification problem with active learni...
ICB
2007
Springer
13 years 11 months ago
2007
Springer
LBP (Local Binary Pattern) as an image operator is used to extract LBPH (LBP histogram) features for texture description. In this paper, we present a novel method to use LBPH featu...