Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Talvitie, Topi"'
Autor:
Arkin, Esther M., Efrat, Alon, Knauer, Christian, Mitchell, Joseph S. B., Polishchuk, Valentin, Rote, Guenter, Schlipf, Lena, Talvitie, Topi
31st International Symposium on Computational Geometry (SoCG 2015)
We show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in or
We show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in or
Externí odkaz:
http://hdl.handle.net/10150/614771
http://arizona.openrepository.com/arizona/handle/10150/614771
http://arizona.openrepository.com/arizona/handle/10150/614771
Publikováno v:
In Artificial Intelligence March 2022 304
Publikováno v:
In International Journal of Approximate Reasoning December 2019 115:69-95
Autor:
Talvitie, Topi
Bayesian networks are probabilistic models that represent dependencies between random variables via directed acyclic graphs (DAGs). They provide a succinct representation for the joint distribution in cases where the dependency structure is sparse. S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1593::796294eb4719c452f90971da15a472f0
http://hdl.handle.net/10138/306782
http://hdl.handle.net/10138/306782
Publikováno v:
Journal of Imaging; Sep2021, Vol. 7 Issue 9, p1-25, 25p
Autor:
Talvitie, Topi Laurinpoika, Kangas, Juho-Kustaa Wiljami, Niinimäki, Teppo Mikael, Koivisto, Mikko Kalle Henrik
Counting the linear extensions of a given partial order is a #P-complete problem that arises in numerous applications. For polynomial-time approximation, several Markov chain Monte Carlo schemes have been proposed; however, little is known of their e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1593::38873c58b68a948ea836e639df99916c
http://hdl.handle.net/10138/298469
http://hdl.handle.net/10138/298469
Publikováno v:
Proceedings of the Thirtieth Annual Symposium Computational Geometry; 6/8/2014, p96-97, 2p