Results 231 to 240 of about 520,046 (284)
Improving Skin Lesion Diagnosis: A Hybrid Approach Using Orthogonal Combination of Local Binary Pattern Features and Ensemble Learning for Diagnostic Accuracy. [PDF]
J Med Signals SensRahmani N, Ebrahimnezhad H.
europepmc +1 more source
Availability of drone mission with binary decision diagram based on uncertain data. [PDF]
Sci RepZaitseva E +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
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
Brown, Gerald G., Shubert, Bruno O.
openaire +2 more sources
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
openaire +2 more sources
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
openaire +2 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 +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
Information Processing Letters, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto De Prisco, Alfredo De Santis
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto De Prisco, Alfredo De Santis
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
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
Journal of Algorithms, 1985
Summary: In this paper the problem of generating all binary trees, as represented by well-formed parentheses strings, in such a way that the changes in successively generated trees are constant is discussed. In particular, an algorithm is developed that generates the strings by simply interchanging a left and a right parenthesis. It is also proven that
Andrzej Proskurowski, Frank Ruskey
openaire +2 more sources
Summary: In this paper the problem of generating all binary trees, as represented by well-formed parentheses strings, in such a way that the changes in successively generated trees are constant is discussed. In particular, an algorithm is developed that generates the strings by simply interchanging a left and a right parenthesis. It is also proven that
Andrzej Proskurowski, Frank Ruskey
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