234 search results - page 11 / 47 » Randomized splay trees: Theoretical and experimental results |
DAM
2007
14 years 11 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
DAWAK
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
FOCS
2006
IEEE
15 years 5 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 ...
113
click to vote
RTCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
· Modelling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst-case conditions and to...