Sciweavers

1772 search results - page 32 / 355
» Classifying Problems into Complexity Classes
Sort
View
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 5 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
NPL
2008
100views more  NPL 2008»
15 years 11 days ago
Comparing Combination Rules of Pairwise Neural Networks Classifiers
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
Olivier Lezoray, Hubert Cardot
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
15 years 2 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
92
Voted
CSR
2006
Springer
15 years 4 months ago
SZK Proofs for Black-Box Group Problems
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
Vikraman Arvind, Bireswar Das
CVPR
2005
IEEE
16 years 2 months ago
Representational Oriented Component Analysis (ROCA) for Face Recognition with One Sample Image per Training Class
Subspace methods such as PCA, LDA, ICA have become a standard tool to perform visual learning and recognition. In this paper we propose Representational Oriented Component Analysi...
Fernando De la Torre, Ralph Gross, Simon Baker, B....