285 search results - page 15 / 57 » New Ways to Construct Binary Search Trees |
EDBT
2000
ACM
15 years 3 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
ICPR
2006
IEEE
16 years 24 days ago
2006
IEEE
Error correcting output codes (ECOC) represent a classification technique that allows a successful extension of binary classifiers to address the multiclass problem. In this paper...
127
click to vote
DATAMINE
1999
14 years 11 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
IJBRA
2006
14 years 11 months ago
2006
: Phylogenetic analysis is a central tool in studies of comparative genomics. When a new region of DNA is isolated and sequenced, researchers are often forced to throw away months ...
ICTAI
2003
IEEE
15 years 5 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...