Zobrazeno 1 - 10
of 266
pro vyhledávání: '"Exponential tree"'
Autor:
Petri P. Kärenlampi
Publikováno v:
Journal of Forestry Research. 30:1167-1178
We present stationarity criteria for forest stands, and establish embodiments using a Norwegian empirical stand development model. The natural stationary states only slightly differ from the outcome of long-term simulations previously implemented usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24dcd2f927185476545827bed0ba1519
https://doi.org/10.1007/s11676-019-00971-4
https://doi.org/10.1007/s11676-019-00971-4
Autor:
Yarong Feng, Hosam M. Mahmoud
Publikováno v:
Methodology and Computing in Applied Probability. 20:575-587
We introduce the random exponential binary tree (EBT) and study its profile. As customary, the tree is extended by padding each leaf node (considered internal), with the appropriate number of external nodes, so that the outdegree of every internal no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c21729216ec33300fce842fd248a49ba
https://doi.org/10.1007/s11009-017-9578-z
https://doi.org/10.1007/s11009-017-9578-z
Autor:
Amin Zollanvari
Publikováno v:
IEEE Signal Processing Letters. 24:71-75
Half a century ago, Chow and Liu proved that the distribution of the first-order dependence tree that optimally approximates an arbitrary joint distribution in terms of Kullback–Leibler cross entropy is the distribution of the maximum-weight depend
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::259b256c18f04f5222af7ae129871298
https://doi.org/10.1109/lsp.2016.2639341
https://doi.org/10.1109/lsp.2016.2639341
Autor:
Artur Jeź, Markus Lohrey
Publikováno v:
31st International Symposium on Theoretical Aspects of Computer Science
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics
A simple linear-time algorithm for constructing a linear context-free tree grammar of size O(rg + r g log (n/r g))for a given input tree T of size n is presented, where g is the size of a minimal linear context-free tree grammar for T, and r is the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96a4e071e7bbe6e50bb71b03b7946124
https://doi.org/10.1016/j.ic.2016.09.007
https://doi.org/10.1016/j.ic.2016.09.007
Autor:
Ioannis Papoutsakis
Publikováno v:
Journal of Computer and System Sciences. 82:817-825
A tree $t$-spanner $T$ of a graph $G$ is a spanning tree of $G$ such that the distance in $T$ between every pair of verices is at most $t$ times the distance in $G$ between them. There are efficient algorithms that find a tree $t\cdot O(\log n)$-span
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f0d2800d064c75fde82afee0c321a6a
https://doi.org/10.1016/j.jcss.2016.02.008
https://doi.org/10.1016/j.jcss.2016.02.008
Autor:
Qiuxin Wu
Publikováno v:
Journal of Computational Methods in Sciences and Engineering. 16:21-27
A 3-tree is a tree with the maximum degree at most three. Let T be a tree of order n and p(T) . In this paper, we prove that the square of T has a spanning tree F in which every leave of T has degree one or two and F has at most max min n − p(T )+7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47e61306fe279ad547b7db73b93f7716
https://doi.org/10.3233/jcm-160598
https://doi.org/10.3233/jcm-160598
Autor:
Markus Sinnl, Ivana Ljubić
Publikováno v:
Mathematical Programming Computation. 8:461-490
The Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant of the classical Steiner tree problem. The goal is to find a tree maximizing the collected revenue, which is associated with nodes, subject to a given budget for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7b2750f37d5174cd0003588c1676ecc
https://doi.org/10.1007/s12532-016-0102-1
https://doi.org/10.1007/s12532-016-0102-1
Autor:
Dongyu Li
Publikováno v:
International Journal of Grid and Distributed Computing. 9:1-16
For the performance and maintenance cost of the existing index methods, this paper presents a distributed multi access entrance B+ tree index method, which has some features that are important in practice, namely (1) achieve efficient parallel interv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94a04e21c5b7228a411ad44468c4caaf
https://doi.org/10.14257/ijgdc.2016.9.2.01
https://doi.org/10.14257/ijgdc.2016.9.2.01
Publikováno v:
Stat. 4:15-31
Dimensionality reduction and manifold learning techniques attempt to recover a lower-dimensional submanifold from the data as encoded in high dimensions. Many techniques, linear or non-linear, have been introduced in the literature. Standard methods,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4e0b26ccb7e113852c8b2914472d22e
https://doi.org/10.1002/sta4.74
https://doi.org/10.1002/sta4.74
Autor:
Kien Trung Nguyen
Publikováno v:
Optimization. 65:253-264
This paper addresses the reverse 1-center problem on a weighted tree. Here, a facility has already been located in a predetermined node of the tree network and we want to improve the 1-center objective value at that node as efficiently as possible wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77436e3e41d7dfc24df7279e5091748d
https://doi.org/10.1080/02331934.2014.994626
https://doi.org/10.1080/02331934.2014.994626