Zobrazeno 1 - 5
of 5
pro vyhledávání: '"algorithmic topology"'
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. In this paper, we initiate the algorithmic study of a high-dimensional cut problem. The problem we study, namely, Homological Hitting Set (HHS), is defined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d4d5ce300234831bd21d2dbf59d5e42
Autor:
Medbouhi, Aniss Aiman
Variational Auto-Encoders (VAEs) are one of the most famous deep generative models. After showing that standard VAEs may not preserve the topology, that is the shape of the data, between the input and the latent space, we tried to modify them so that
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309487
Autor:
Medbouhi, Aniss Aiman
Variational Auto-Encoders (VAEs) are one of the most famous deep generative models. After showing that standard VAEs may not preserve the topology, that is the shape of the data, between the input and the latent space, we tried to modify them so that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bd98afbe8f154f5f8320f7324c1ef7b7
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309487
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-309487
Publikováno v:
Revista Integración, Volume: 33, Issue: 2, Pages: 105-97, Published: DEC 2015
Un logro notable de la topología algorítmica es el resultado de A.A. Márkov sobre la insolubilidad del problema del homeomorfismo para variedades. Posteriormente, Boone, Haken y Poénaru extendieron la idea original de Márkov al caso de variedade
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______618::6c3e59bef6bffc196559cd81aac05508
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0120-419X2015000200001&lng=en&tlng=en
http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0120-419X2015000200001&lng=en&tlng=en
Autor:
Feldman, D. V.1
Publikováno v:
Choice: Current Reviews for Academic Libraries. Mar2004, Vol. 41 Issue 7, p1331-1331. 1/6p.
