Doctoral thesis

Algorithms and complexity results for discrete probabilistic reasoning tasks

  • Mauá, Denis Deratani
  • Schmidhuber, Jürgen (degree supervisor)
  • Zaffalon, Marco (degree committee member)
  • Polpo de Campos, Cassio (degree committee member)
Show more…

134 p

Thèse de doctorat: Università della Svizzera italiana, 2013

English Many solutions to problems in machine learning and artificial intelligence involve solving a combinatorial optimization problem over discrete variables whose functional dependence is conveniently represented by a graph. This thesis addresses three types of these combinatorial optimization problems, namely, the maximum a posteriori inference in discrete probabilistic graphical models, the... Show more…
  • English
Computer science
License undefined
Persistent URL