The complexity of plate probabilistic models

Fabio G. Cozman, Denis D. Mauá

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferencia

4 Citas (Scopus)

Resumen

© Springer International Publishing Switzerland 2015. Plate-based probabilistic models combine a few relational constructs with Bayesian networks, so as to allow one to specify large and repetitive probabilistic networks in a compact and intuitive manner. In this paper we investigate the combined, data and domain complexity of plate models, showing that they range from polynomial to #P-complete to #EXP-complete.
Idioma originalInglés estadounidense
Título de la publicación alojadaThe complexity of plate probabilistic models
Páginas36-49
Número de páginas14
ISBN (versión digital)9783319235394
DOI
EstadoPublicada - 1 ene 2015
Publicado de forma externa
EventoLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) -
Duración: 1 ene 2018 → …

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen9310
ISSN (versión impresa)0302-9743

Conferencia

ConferenciaLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Período1/01/18 → …

Huella Profundice en los temas de investigación de 'The complexity of plate probabilistic models'. En conjunto forman una huella única.

  • Citar esto

    Cozman, F. G., & Mauá, D. D. (2015). The complexity of plate probabilistic models. En The complexity of plate probabilistic models (pp. 36-49). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9310). https://doi.org/10.1007/978-3-319-23540-0_3