An approximate algorithm for the multiple constant multiplications problem.
Levent AksoyEce Olcay GünesPublished in: SBCCI (2008)
Keyphrases
- experimental evaluation
- k means
- np hard
- dynamic programming
- matching algorithm
- preprocessing
- single pass
- high accuracy
- detection algorithm
- expectation maximization
- significant improvement
- computational cost
- improved algorithm
- classification algorithm
- times faster
- worst case
- cost function
- search space
- learning algorithm
- objective function
- estimation algorithm
- recognition algorithm
- multiple models
- experimental study
- theoretical analysis
- particle swarm optimization
- input data
- linear programming
- simulated annealing
- probabilistic model
- search algorithm