Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities.

Anders Bergkvist Peter Damaschke

Published in: ISAAC (2005)

Keyphrases

learning algorithm
computational complexity
optimization problems
graph theory
significant improvement
computational cost
theoretical analysis
times faster
statistical methods
recently developed
high dimensional
computationally efficient
benchmark datasets
classification algorithm