310 search results - page 20 / 62 » Randomized Binary Search Trees |
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
ICANN
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
ICDCSW
2003
IEEE
14 years 3 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
SWAT
1992
Springer
14 years 1 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
CC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...