450 search results - page 14 / 90 » Estimating Search Tree Size |
ICCAD
1993
IEEE
14 years 1 months ago
1993
IEEE
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
DAGSTUHL
2007
13 years 10 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
CG
2006
Springer
14 years 19 days ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Within this paper a new framework for Bayesian tracking is presented, which approximates the posterior distribution at multiple resolutions. We propose a tree-based representation...
JCB
2006
13 years 8 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...