1772 search results - page 115 / 355 » Classifying Problems into Complexity Classes |
159
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
196
click to vote
AGI
2011
14 years 10 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
167
click to vote
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
We develop a pairwise classification framework for face recognition, in which a class face recognition problem is divided into a set of ? ?? ? two class problems. Such a problem...
197
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
176
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...