1772 search results - page 53 / 355 » Classifying Problems into Complexity Classes |
SIAMCOMP
2000
13 years 9 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
ML
2008
ACM
13 years 10 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
The computer aided diagnosis (CAD) problems of detecting
potentially diseased structures from medical images are
typically distinguished by the following challenging characterist...