Buscar
Mostrando ítems 1-10 de 375
THE SPECTRUM OF THE LAPLACIAN MATRIX OF A BALANCED 2p-ARY TREE
(Universidad Católica del Norte, Departamento de Matemáticas, 2004)
STIT Process and Trees
(Polymat, 2015)
For the STIT tessellation process, which is becoming one of the reference model in stochastic geometry for fracture modeling or cell division, we study several constructions in a window of R-l: A new method is provided ...
Combinatorial Hopf Algebras on Baxter Binary TreesCombinatorial hopf algebras on baxter binary trees
(2012)
Combinatorial Hopf Algebras on Baxter Binary Trees
Combinatorial hopf algebras on baxter binary trees
(2012)
This thesis is developed in the area of combinatorial algebraic structures on planar binary trees, particularly, combinatorial Hopf algebras.In 1995, Claudia Malvenuto and Christophe Reutenauer introduced a graded Hopf ...
Compressed representation of dynamic binary relations with applications
(Elsevier, 2017)
We introduce a dynamic data structure for the compact representation of binary relations R subset of A x B. The data structure is a dynamic variant of the k(2)-tree, a static compact representation that takes advantage of ...
Optimal binary search trees with costs depending on the access paths
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Building binary-tree-based multiclass classifiers using separability measures
(ELSEVIER SCIENCE BV, 2010)
Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than ...
Interpretable clustering using unsupervised binary trees
(Springer, 2013-03)
We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity ...