785 search results - page 28 / 157 » Binary Join Trees |
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
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 ...
132
click to vote
AROBOTS
2011
14 years 4 months ago
2011
— 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...
100
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
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...
116
click to vote
PAMI
2011
14 years 4 months ago
2011
—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 ...
ICIP
2005
IEEE
15 years 3 months ago
2005
IEEE
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...