Sciweavers

785 search results - page 28 / 157
» Binary Join Trees
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 8 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
AROBOTS
2011
14 years 11 months ago
Human motion database with a binary tree and node transition graphs
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
Katsu Yamane, Yoshifumi Yamaguchi, Yoshihiko Nakam...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
PAMI
2011
14 years 11 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
142
Voted
ICIP
2005
IEEE
15 years 10 months ago
Object representation using colour, shape and structure criteria in a binary partition tree
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
Christian Ferran Bennström, Josep R. Casas