3055 search results - page 335 / 611 » Randomized Search Trees |
108
Voted
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
We demonstrate the IPL B+ -tree prototype, which has been designed as a flash-aware index structure by adopting the in-page logging (IPL) scheme. The IPL scheme has been proposed ...
108
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
101
Voted
ESANN
2008
15 years 5 months ago
2008
In this paper we solve the problem of classifying chestnut plants according to their place of origin. We compare the results obtained by state of the art classifiers, among which,...
129
Voted
JCSS
2006
15 years 3 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
170
Voted
COMBINATORICA
2011
14 years 3 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...