Results 251 to 260 of about 68,890 (299)
Moonshine.jl: a Julia package for genome-scale model-based ancestral recombination graph inference. [PDF]
Front GenetFournier P, Larribe F.
europepmc +1 more source
An explainable AI framework for enhanced software defect prediction using transformer-assisted boosting. [PDF]
Sci RepKun Q +5 more
europepmc +1 more source
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.
Roberto De Prisco, Alfredo De Santis
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto De Prisco, Alfredo De Santis
exaly +3 more sources
The algebra of binary search trees
Theoretical Computer Science, 2005 49 ...
Hivert, Florent +2 more
exaly +4 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
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 +2 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 +2 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 +1 more source
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 +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 +2 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 +2 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 +1 more source
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 +1 more source