An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings.
Beate BolligTobias PrögerPublished in: LATA (2012)
Keyphrases
- computationally efficient
- theoretical analysis
- dynamic programming
- probabilistic model
- learning algorithm
- times faster
- computational complexity
- detection algorithm
- optimization algorithm
- memory efficient
- improved algorithm
- matching algorithm
- segmentation algorithm
- experimental evaluation
- similarity measure
- k means
- preprocessing
- optimal solution
- high accuracy
- np hard
- significant improvement
- convergence rate
- genetic algorithm
- recognition algorithm
- objective function
- domain independent
- search space
- graph cuts
- particle swarm optimization
- simulated annealing