18 search results - page 2 / 4 » Upper Bounds for Maximally Greedy Binary Search Trees |
ICTAI
2010
IEEE
13 years 2 months ago
2010
IEEE
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
HEURISTICS
1998
13 years 4 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
ALGORITHMICA
2005
13 years 4 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
SWAT
1992
Springer
13 years 9 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 ...