Vytisknout
0539983 - ÚTIA 2022 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Studený, Milan - Cussens, J. - Kratochvíl, Václav
Dual formulation of the chordal graph conjecture.
Proceedings of Machine Learning Research, Volume 138: International Conference on Probabilistic Graphical Models, 23-25 September 2020, Hotel Comwell Rebild Bakker, Skørping, Denmark. Brookline: JMLR, Inc. and Microtome Publishing, 2021 - (Nielsen, T.; Jaeger, M.), s. 449-460. E-ISSN 2640-3498.
[International Conference on Probabilistic Graphical Models 2021 /10./. Skørping (DK), 23.09.2020-25.09.2020]
Grant CEP: GA ČR(CZ) GA19-04579S
Institucionální podpora: RVO:67985556
Klíčová slova: Learning decomposable models * chordal graph polytope * clutter inequalities * dual polyhedron * chordal graph inequalities
Obor OECD: Statistics and probability
http://library.utia.cas.cz/separaty/2021/MTR/studeny-0539983.pdf
Trvalý link: http://hdl.handle.net/11104/0320770
Studený, Milan - Cussens, J. - Kratochvíl, Václav
Dual formulation of the chordal graph conjecture.
Proceedings of Machine Learning Research, Volume 138: International Conference on Probabilistic Graphical Models, 23-25 September 2020, Hotel Comwell Rebild Bakker, Skørping, Denmark. Brookline: JMLR, Inc. and Microtome Publishing, 2021 - (Nielsen, T.; Jaeger, M.), s. 449-460. E-ISSN 2640-3498.
[International Conference on Probabilistic Graphical Models 2021 /10./. Skørping (DK), 23.09.2020-25.09.2020]
Grant CEP: GA ČR(CZ) GA19-04579S
Institucionální podpora: RVO:67985556
Klíčová slova: Learning decomposable models * chordal graph polytope * clutter inequalities * dual polyhedron * chordal graph inequalities
Obor OECD: Statistics and probability
http://library.utia.cas.cz/separaty/2021/MTR/studeny-0539983.pdf
Trvalý link: http://hdl.handle.net/11104/0320770