Zobrazeno 1 - 10
of 795
pro vyhledávání: '"Weight-balanced tree"'
Autor:
Arnab Mitra, Sayantan Saha
Publikováno v:
Smart Innovation, Systems and Technologies ISBN: 9789811562013
Investigation for the scope for implementation of green computing in fog network is an important focus among researchers. For this reason, a weight-balanced tree-based architecture in fog network is presented in this research. It is observed that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1707b1984670292251291e09395f0abb
https://doi.org/10.1007/978-981-15-6202-0_1
https://doi.org/10.1007/978-981-15-6202-0_1
Publikováno v:
Information Processing Letters. 125:41-45
The main purpose of this paper is to answer two questions about the distributional complexity of multi-branching trees. We first show that for any independent distribution d on assignments for a multi-branching tree, a certain directional algorithm D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::230fc20f6536c0dd672318fa8d712f41
https://doi.org/10.1016/j.ipl.2017.05.002
https://doi.org/10.1016/j.ipl.2017.05.002
Autor:
Mohammad Q. Vahidi-Asl, Mehri Javanian
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 51:7-15
Ordinary digital search trees (DSTs) stores one word in each of its internal nodes and leaves, but a DST with paging size b allows storing b words in the leaves, which corresponds to pages in auxiliary storage. In this paper, we analyse the average n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::752be6c834616acbf6fceb3a9bbd28fd
https://doi.org/10.1051/ita/2017002
https://doi.org/10.1051/ita/2017002
Autor:
Carlos Roberto França
Publikováno v:
American Journal of Computational Mathematics. :29-39
This paper deals with the efficiency of the search, with a method of organization and storage of the information that allows better results than the research trees or binary trees. No one ever dared to present better results than 0(log n) complexity,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3d19ea82eecbc89614bd4224e507049
https://doi.org/10.4236/ajcm.2017.71003
https://doi.org/10.4236/ajcm.2017.71003
Publikováno v:
Discrete Applied Mathematics. 215:1-13
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a2dc076840cce655d63b70995b9d13d
https://doi.org/10.1016/j.dam.2016.07.009
https://doi.org/10.1016/j.dam.2016.07.009
Publikováno v:
ISIT
Compression schemes for advanced data structures have become a central modern challenge. Information theory has traditionally dealt with conventional data such as text, images, or video. In contrast, most data available today is multitype and context
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e2be0e7696ab4b72c414d0f0ce0d533
https://pubmed.ncbi.nlm.nih.gov/31537945
https://pubmed.ncbi.nlm.nih.gov/31537945
Publikováno v:
ALENEX 2019-Algorithm Engineering and Experiments
ALENEX 2019-Algorithm Engineering and Experiments, Jan 2019, San Diego, United States. pp.39-53, ⟨10.1137/1.9781611975499.4⟩
ALENEX
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
ALENEX 2019-Algorithm Engineering and Experiments, Jan 2019, San Diego, United States. pp.39-53, ⟨10.1137/1.9781611975499.4⟩
ALENEX
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
International audience; The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c1018d95df50d0b93f617bbfdee1a39
https://hal.science/hal-01294013v3/document
https://hal.science/hal-01294013v3/document
Publikováno v:
IEEE Transactions on Information Forensics and Security. 11:2312-2321
In this paper, we study both topological and algebraic properties of unrooted Gaussian trees in order to characterize their security performance. Such performance is measured by the corresponding potential in extracting common randomness from a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::892632de7eeb6c1c7ac0f1c630ad0afe
https://doi.org/10.1109/tifs.2016.2543688
https://doi.org/10.1109/tifs.2016.2543688
Publikováno v:
ACM Transactions on Algorithms. 12:1-31
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect deletion rebalancing, and many B-tree--based database systems do not do it.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4efd746ba706948dbb436b0d50eb76f
https://doi.org/10.1145/2903142
https://doi.org/10.1145/2903142
Publikováno v:
Discrete Optimization. 21:85-117
In this paper we study the Steiner tree problem with degree constraints. Motivated by an application in computational biology we focus on binary Steiner trees in which all node degrees are required to be at most three. It is shown that finding a bina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0aaed24f3a2c3a7fe29aab9053e8bfb
https://doi.org/10.1016/j.disopt.2016.05.006
https://doi.org/10.1016/j.disopt.2016.05.006