316 search results - page 9 / 64 » Bounded Depth Data Trees |
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider the problem of estimating and encoding depth maps from multiple views in the context of 3D-TV with free-viewpoint rendering. We propose a novel codec based on the Rate...
123
click to vote
RTSS
2006
IEEE
15 years 5 months ago
2006
IEEE
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
TSMC
2002
14 years 11 months ago
2002
A fuzzy knowledge-based network is developed based on the linguistic rules extracted from a fuzzy decision tree. A scheme for automatic linguistic discretization of continuous attr...
104
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...