Results 1 to 10 of about 352,001 (275)
Clifford Algebras, Spin Groups and Qubit Trees [PDF]
Quanta, 2022 Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous ...
Alexander Yurievich Vlasov
doaj +4 more sources
The algebra of binary search trees
Theoretical Computer Science, 2005 49 ...
Hivert, Florent +2 more
openaire +5 more sources
Modification of hashing algorithm to increase rate of operations in nosql databases
Adaptivni Sistemi Avtomatičnogo Upravlinnâ, 2021 The object of research is indexing methods in non-relational databases. The article reviews the most common hashing algorithms and the proposed hashing algorithm based on prime numbers and binary number system.
В. Нікітін +3 more
doaj +1 more source
Representation of binary classification trees with binary features by quantum circuits [PDF]
Quantum, 2022 We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision tree can be ...
Raoul Heese +2 more
doaj +1 more source
AGAT: Building and evaluating binary partition trees for image segmentation
SoftwareX, 2021 AGAT is a Java library dedicated to the construction, handling and evaluation of binary partition trees, a hierarchical data structure providing multiscale partitioning of images and, more generally, of valued graphs. On the one hand, this library offers
Jimmy Francky Randrianasoa +3 more
doaj +1 more source
Lattice of combinatorial Hopf algebras: binary trees with multiplicities [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras.
Jean-Baptiste Priez
doaj +1 more source
Simple Balanced Binary Search Trees [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations.
Prabhakar Ragde
doaj +1 more source
Enumeration of Binary Trees and Universal Types [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number.
Charles Knessl, Wojciech Szpankowski
doaj +3 more sources
Hybrid CPU-GPU Community Detection in Weighted Networks
IEEE Access, 2020 Recently, a new trend has emerged in the field of parallel and high performance computing, the hybrid implementation using CPU-GPU modules. In such implementations, the computational load is shared between the CPU and GPU, in order to improve the ...
Stavros Souravlas +2 more
doaj +1 more source
Descendants and ascendants in binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 There are three classical algorithms to visit all the nodes of a binary tree-preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the ...
Alois Panholzer, Helmut Prodinger
doaj +2 more sources