514 search results - page 9 / 103 » On the Structure of Valiant's Complexity Classes |
UAI
2008
13 years 10 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
PAMI
2008
13 years 8 months ago
2008
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
ALT
2003
Springer
14 years 5 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...