459 search results - page 5 / 92 » Computational Complexity of Probabilistic Disambiguation |
UAI
2008
14 years 11 months ago
2008
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
ENTCS
2008
14 years 9 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
91
Voted
IJCAI
2001
14 years 11 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
83
Voted
ISVC
2007
Springer
15 years 3 months ago
2007
Springer
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
94
Voted
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...