87 search results - page 3 / 18 » Dynamic Maximum Tree Depth |
APPROX
2000
Springer
15 years 4 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 ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
We consider applications using depth-based Imagebased rendering (IBR), where the synthesis of arbitrary views occur at a remote location, necessitating the compression and transmi...
95
Voted
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
101
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...