4 search results - page 1 / 1 » Smoothed Analysis of Binary Search Trees and Quicksort Under... |
DAGSTUHL
2007
13 years 6 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...
SIAMCOMP
2002
13 years 4 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
CVPR
2009
IEEE
14 years 11 months ago
2009
IEEE
We consider the problem of single image object motion deblurring from a static camera. It is well known that deblurring of moving objects using a traditional camera is ill-posed, d...