1772 search results - page 17 / 355 » Classifying Problems into Complexity Classes |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple...
COMPUTING
2010
13 years 5 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
COST
2009
Springer
13 years 5 months ago
2009
Springer
This paper presents a novel facial expression recognition methodology. In order to classify the expression of a test face to one of seven pre-determined facial expression classes, ...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...