Sciweavers

459 search results - page 7 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
ICANN
2010
Springer
14 years 9 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 9 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
IJAR
2008
95views more  IJAR 2008»
14 years 9 months ago
Complexity results for enhanced qualitative probabilistic networks
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
Johan Kwisthout, Gerard Tel
101
Voted
CAISE
2010
Springer
14 years 10 months ago
Probabilistic Models to Reconcile Complex Data from Inaccurate Data Sources
There is a large amount of data that is published on the Web and several techniques have been developed to extract and integrate data from Web sources. However, Web data are inhere...
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, ...
ISORC
2003
IEEE
15 years 2 months ago
Probabilistic Simulation-Based Analysis of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
Anders Wall, Johan Andersson, Christer Norströ...