234 search results - page 21 / 47 » An Introduction to Binary Search Trees and Balanced Trees |
CAIP
2009
Springer
15 years 28 days ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
ACNS
2005
Springer
15 years 3 months ago
2005
Springer
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
67
Voted
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....