QP tries are smaller and faster than crit-bit trees.

Published in: Tiny Trans. Comput. Sci. (2016)

Keyphrases

decision trees
quadratic programming
support vector machine
linear programming
tree structures
learning algorithm
tree structure
memory efficient
decomposition algorithm
bit vector
computational complexity
rate control
tree construction
tree automata
binary trees