Sciweavers

28888 search results - page 383 / 5778
» Computability and complexity in analysis
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola
RSFDGRC
2005
Springer
208views Data Mining» more  RSFDGRC 2005»
16 years 8 days ago
On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
Dan Wu, Cory J. Butz
COGSCI
2004
82views more  COGSCI 2004»
15 years 6 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
IFIPTCS
2010
15 years 4 months ago
Initial Segment Complexities of Randomness Notions
Schnorr famously proved that Martin-L
Rupert Hölzl, Thorsten Kräling, Frank St...
GC
2011
Springer
14 years 10 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...