77 search results - page 6 / 16 » Optimal leaf ordering of complete binary trees |
COMBINATORICA
2011
12 years 7 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
IGARSS
2010
13 years 4 months ago
2010
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...