1772 search results - page 164 / 355 » Classifying Problems into Complexity Classes |
219
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
159
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
169
click to vote
ICRA
2006
IEEE
16 years 15 days ago
2006
IEEE
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
162
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In a previous paper [1], we have presented a new linear classification algorithm, Principal Component Null Space Analysis (PCNSA) which is designed for problems like object recogn...
165
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In practical classification, there is often a mix of learnable and unlearnable classes and only a classifier above a minimum performance threshold can be deployed. This problem is...