310 search results - page 37 / 62 » Randomized Binary Search Trees |
CSDA
2008
13 years 10 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
ACCV
2009
Springer
14 years 4 months ago
2009
Springer
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
SIAMCOMP
2002
13 years 9 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 ...