Sciweavers

280 search results - page 1 / 56
» Efficient Calculation of the Complete Optimal Classification...
Sort
View
ICPR
2004
IEEE
14 years 5 months ago
Efficient Calculation of the Complete Optimal Classification Set
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...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
EUROCAST
2009
Springer
116views Hardware» more  EUROCAST 2009»
13 years 8 months ago
Complete Sets of Hamiltonian Circuits for Classification of Documents
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...
Bernd Steinbach, Christian Posthoff
FGR
2004
IEEE
130views Biometrics» more  FGR 2004»
13 years 8 months ago
Sparse Models for Gender Classification
A class of sparse regularization functions are considered for the developing sparse classifiers for determining facial gender. The sparse classification method aims to both select...
Nicholas Costen, Martin Brown, Shigeru Akamatsu
BMCBI
2007
161views more  BMCBI 2007»
13 years 4 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
PAMI
2012
11 years 7 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens