Sciweavers

1772 search results - page 205 / 355
» Classifying Problems into Complexity Classes
Sort
View
JDCTA
2010
272views more  JDCTA 2010»
14 years 7 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
FOCS
2007
IEEE
15 years 7 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
AICCSA
2006
IEEE
133views Hardware» more  AICCSA 2006»
15 years 6 months ago
Learning acyclic rules based on Chaining Genetic Programming
Multi-class problem is the class of problems having more than one classes in the data set. Bayesian Network (BN) is a well-known algorithm handling the multi-class problem and is ...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
STACS
1992
Springer
15 years 4 months ago
Graph Isomorphism is Low for PP
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
Johannes Köbler, Uwe Schöning, Jacobo To...
100
Voted
CVPR
2005
IEEE
16 years 2 months ago
Nonparametric Subspace Analysis for Face Recognition
Linear discriminant analysis (LDA) is a popular face recognition technique. However, an inherent problem with this technique stems from the parametric nature of the scatter matrix...
Zhifeng Li, Wei Liu, Dahua Lin, Xiaoou Tang