Fast algorithms for finding disjoint subsequences with extremal densities.
Anders BergkvistPeter DamaschkePublished in: Pattern Recognit. (2006)
Keyphrases
- graph theory
- learning algorithm
- computational efficiency
- computational cost
- recently developed
- benchmark datasets
- real time
- pairwise
- face recognition
- knowledge base
- optimization problems
- computationally efficient
- machine learning algorithms
- information systems
- machine learning
- probability density function
- data sets