459 search results - page 43 / 92 » Computational Complexity of Probabilistic Disambiguation |
STOC
1998
ACM
15 years 4 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
116
click to vote
IPMI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
112
click to vote
COMPGEOM
1995
ACM
15 years 3 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
112
click to vote
AUSAI
2008
Springer
15 years 1 months ago
2008
Springer
In recent years, there has been a cross-fertilization of ideas between computational neuroscience models of the operation of the neocortex and artificial intelligence models of mac...
JMLR
2010
14 years 6 months ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...