Results 91 to 100 of about 1,259,069 (138)
Covert communication model based on dynamic time binary trees
Tongxin xuebaoA covert communication model based on a dynamic time binary tree was proposed to address the efficiency and security issues in blockchain-based covert communication.
SHE Wei +5 more
doaj
Horton-Strahler numbers for binary butterfly trees: exact analysis
Enumerative Combinatorics and ApplicationsHelmut Prodinger
doaj +1 more source
Proceedings of the annual conference on - ACM 76, 1976 Family pedigree data as required by genetics has proven to be difficult to analyze. This paper presents a data collection and structuring technique developed for the program PDGRE, which significantly improves on past computer application performances and produces a binary tree representation for the data.
Frank Ruskey, T. C. Hu
doaj +7 more sources
Mathematics of Operations Research, 1984 A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Gerald Brown
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information Processing Letters, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo de Santis, Roberto de Prisco
exaly +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo de Santis, Roberto de Prisco
exaly +4 more sources
Information Processing Letters, 1994
The authors present a procedure for listing binary trees of order \(n\) based on ternary sequences.
Bapiraju Vinnakota, V. V. Bapeswara Rao
openaire +3 more sources
The authors present a procedure for listing binary trees of order \(n\) based on ternary sequences.
Bapiraju Vinnakota, V. V. Bapeswara Rao
openaire +3 more sources
[1988 Proceedings] 9th International Conference on Pattern Recognition, 2003
A method of representing a binary image is developed. This method, called linear binary tree (LBT), is more effective than the linear quadtree (LQT) method. A LBT can be represented by encoding each black node with a binary integer whose digits reflect successive one-half subdivisions.
Chuanbo Chen, Haiming Zou
openaire +2 more sources
A method of representing a binary image is developed. This method, called linear binary tree (LBT), is more effective than the linear quadtree (LQT) method. A LBT can be represented by encoding each black node with a binary integer whose digits reflect successive one-half subdivisions.
Chuanbo Chen, Haiming Zou
openaire +2 more sources
Information Systems, 1982
Abstract A dynamic page allocation technique for binary search trees is proposed. The method is based on page splitting, like the B-tree construction procedure, and on balanced bunch allocation into the pages. An analysis of the paged index structure resulting from the proposed allocation technique is performed. Furthermore the resulting index can be
Francesca Cesarini, Giovanni Soda
openaire +1 more source
Abstract A dynamic page allocation technique for binary search trees is proposed. The method is based on page splitting, like the B-tree construction procedure, and on balanced bunch allocation into the pages. An analysis of the paged index structure resulting from the proposed allocation technique is performed. Furthermore the resulting index can be
Francesca Cesarini, Giovanni Soda
openaire +1 more source
SIAM Journal on Computing, 1989
Summary: The problem of ranking the K-best binary trees with respect to their weighted average leaves' levels is considered. Both the alphabetic case, where the order of the weights in the sequence \(w_ 1,...,w_ n\) must be preserved in the leaves of the tree, and the nonalphabetic case, where no such restriction is imposed, are studied.
Shoshana Anily, Refael Hassin
openaire +3 more sources
Summary: The problem of ranking the K-best binary trees with respect to their weighted average leaves' levels is considered. Both the alphabetic case, where the order of the weights in the sequence \(w_ 1,...,w_ n\) must be preserved in the leaves of the tree, and the nonalphabetic case, where no such restriction is imposed, are studied.
Shoshana Anily, Refael Hassin
openaire +3 more sources
Acta Informatica, 1984
A data encoding scheme involving the linearization of binary trees is presented and analyzed. This encoding scheme is self-delimiting, uniquely deconcatenable and has other attractive properties for certain kinds of applications (such as associative memory).
openaire +2 more sources
A data encoding scheme involving the linearization of binary trees is presented and analyzed. This encoding scheme is self-delimiting, uniquely deconcatenable and has other attractive properties for certain kinds of applications (such as associative memory).
openaire +2 more sources