Results 61 to 70 of about 1,259,069 (138)
IEEE Access, 2019 Several synchronous applications are based on the graph-structured data; among them, a very important application of this kind is community detection.
Stavros Souravlas +2 more
doaj +1 more source
Integer Partitions and Binary Trees
Advances in Applied Mathematics, 2002 If \(\alpha\) is the 2-core, \((\beta_0,\beta_1)\) the 2-quotient of a partition \(\lambda\), then the triple \((\alpha; \beta_0,\beta_1)\) uniquely determines \(\lambda\); see \textit{G. James} and \textit{A. Kerber} [The representation theory of the symmetric group (Addison-Wesley, Reading, MA) (1981; Zbl 0491.20010)]. The present author constructs a
openaire +3 more sources
The Botanical Beauty of Random Binary Trees
, 1996 We present a simple mechanism for quickly rendering computer images of botanical trees based on random binary trees commonly found in computer science. That is, we visualize abstract binary trees as botanical ones.
Devroye, Luc, Kruszewski, Paul
core +1 more source
Generating Random Binary Trees - A Survey
, 1998 This paper surveys algorithms for generating unbiased random binary trees. There exist several linear time algorithms.
Trees A Survey, Erkki Mäkinen
core
A Linear-Time Approximation Algorithm for Rotation Distance
Journal of Graph Algorithms and Applications, 2010 Rotation distance between rooted binary trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance.
Sean Cleary, Katherine St. John
doaj +1 more source
Optimal binary space partitions for orthogonal objects [PDF]
A binary space partition, or BSP is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects are separated. BSPs are widely used in computer graphics as the underlying data structure for computations such as real-time
Paterson, Michael S., Yao, F. Frances
core
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
Sensors, 2015 In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood ...
Wan-Yu Chang +2 more
doaj +1 more source
Non-Contiguous Pattern Avoidance in Binary Trees [PDF]
, 2011 We consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by modifying a known algorithm that counts binary trees avoiding a single contiguous tree pattern.
Wynn, Casey +2 more
core +1 more source
Journal of Combinatorial Theory, Series A, 2012 A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible and $T$ displays $\cP$.
openaire +3 more sources
Adaptation of Zerotrees Using Signed Binary Digit Representations for 3D Image Coding [PDF]
, 2007 Zerotrees of wavelet coefficients have shown a good adaptability for the compression of three-dimensional images. EZW, the original algorithm using zerotree, shows good performance and was successfully adapted to 3D image compression.
Pierre Duhamel +8 more
core +1 more source