1772 search results - page 60 / 355 » Classifying Problems into Complexity Classes |
112
click to vote
DAWAK
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. There is an urgent need for sound approaches to integrative and collaborative analysis of large, autonomous (and hence, inevitably semantically heterogeneous) data source...
101
Voted
AIPS
2004
15 years 1 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
125
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Object/scene detection by discriminative kernel-based classification has gained great interest due to its promising performance and flexibility. In this paper, unlike traditional ...
100
click to vote
NIPS
2008
15 years 1 months ago
2008
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
96
Voted
AI
2005
Springer
15 years 13 days ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...