Zobrazeno 1 - 10
of 943
pro vyhledávání: '"Moral graph"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
The Annals of Statistics, 2018 Feb 01. 46(1), 90-118.
Externí odkaz:
https://www.jstor.org/stable/26542779
Publikováno v:
Theoretical Computer Science. 885:77-90
A family of Markov blankets, if learned purely as a set of subsets of variables, may not be consistent with any Bayesian network. This inconsistency may have a negative impact on Markov blanket-based structure learning. In this paper, we propose chec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7b4426341179029073cbfd401c05a1b
https://doi.org/10.1016/j.tcs.2021.06.024
https://doi.org/10.1016/j.tcs.2021.06.024
Publikováno v:
Monash University
Graph Drawing ISBN: 9783642002182
Graph Drawing
Graph Drawing ISBN: 9783642002182
Graph Drawing
Constrained graph layout is a recent generalisation of force-directed graph layout which allows constraints on node placement. We give a constrained graph layout algorithm that takes an initial feasible layout and improves it while preserving the top
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e18383bd2e464281444235fed228d79e
Publikováno v:
Ann. Statist. 46, no. 1 (2018), 90-118
arXiv
arXiv
© Institute of Mathematical Statistics, 2018. Gaussian graphical models have received considerable attention during the past four decades from the statistical and machine learning communities. In Bayesian treatments of this model, the G-Wishart dist
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bc6b9733618ba4bcfc3f1a37334b603
https://projecteuclid.org/euclid.aos/1519268425
https://projecteuclid.org/euclid.aos/1519268425
Publikováno v:
Information Sciences. :575-580
In this paper, we describe some highlights of the new branch quantitative graph theory and explain its significant different features compared to classical graph theory. The main goal of quantitative graph theory is the structural quantification of i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a48515b5da97ae2fc0d92a3bd8813df
https://doi.org/10.1016/j.ins.2017.08.009
https://doi.org/10.1016/j.ins.2017.08.009
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 39:2227-2241
Many scientific datasets are of high dimension, and the analysis usually requires retaining the most important structures of data. Principal curve is a widely used approach for this purpose. However, many existing methods work only for data with stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b7b87579ca850de2ad604a37483e6b4
https://doi.org/10.1109/tpami.2016.2635657
https://doi.org/10.1109/tpami.2016.2635657
Publikováno v:
Journal of Parallel and Distributed Computing. 109:1-14
A cut tree is a combinatorial structure that represents the edge-connectivity between all pairs of vertices of an undirected graph. Cut trees solve the all pairs minimum s – t -cut problem efficiently. Cut trees have a large number of applications
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17723f76dfdf8f9a8fd763e1c3fc828d
https://doi.org/10.1016/j.jpdc.2017.04.007
https://doi.org/10.1016/j.jpdc.2017.04.007
Publikováno v:
IEEE Transactions on Signal Processing. 65:5164-5178
In this paper, an M -channel perfect reconstruction filter bank based on a coarsening algorithm is proposed. Compared with most of the designs of graph filter banks that do not consider the graph reconstruction, our proposed design can provide the pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d4d0917901d98e26f9352dbaaa832c0
https://doi.org/10.1109/tsp.2017.2726984
https://doi.org/10.1109/tsp.2017.2726984