281 search results - page 4 / 57 » Balancing weight-balanced trees |
SIAMCOMP
2000
13 years 8 months ago
2000
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
ICSOFT
2007
13 years 9 months ago
2007
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...