1772 search results - page 17 / 355 » Classifying Problems into Complexity Classes |
131
Voted
ICPR
2002
IEEE
16 years 3 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...
135
Voted
COMPUTING
2010
15 years 5 days 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....
159
Voted
COST
2009
Springer
15 years 18 days 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, ...
145
Voted
IWOCA
2010
Springer
14 years 9 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 ...
121
Voted
SODA
2001
ACM
15 years 4 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...