310 search results - page 37 / 62 » Randomized Binary Search Trees |
126
click to vote
CSDA
2008
15 years 1 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,...
103
click to vote
CIKM
2009
Springer
15 years 5 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...
130
click to vote
GECCO
2005
Springer
15 years 7 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...
100
click to vote
ACCV
2009
Springer
15 years 8 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...
143
click to vote
SIAMCOMP
2002
15 years 1 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 ...