1772 search results - page 132 / 355 » Classifying Problems into Complexity Classes |
189
click to vote
EKNOW
2009
15 years 4 months ago
2009
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...
216
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
208
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
164
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
177
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
We introduce in this paper two probabilistic reasoning models (PRM-1 and PRM-2) which combine the Principal Component Analysis (PCA) technique and the Bayes classifier and show th...