4218 search results - page 9 / 844 » Complete sets of cooperations |
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
ETS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, complex mixed signal circuits such as SiP or SOC including several ADCs and DACs are considered. A new DFT technique is proposed allowing the test of this complete ...
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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We propose a new set of rotationally and translationally invariant features for image or pattern recognition and classification. The new features are cubic polynomials in the pix...
IGPL
2010
13 years 6 months ago
2010
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...