Asymptotic Behaviour of a BIPF Algorithm with an Improper Target.
Claudio AsciMauro PiccioniPublished in: Kybernetika (2009)
Keyphrases
- objective function
- worst case
- dynamic programming
- cost function
- computational complexity
- detection algorithm
- computational cost
- preprocessing
- improved algorithm
- learning algorithm
- particle swarm optimization
- classification algorithm
- optimization algorithm
- input data
- experimental evaluation
- np hard
- significant improvement
- estimation algorithm
- times faster
- single pass
- high accuracy
- path planning
- expectation maximization
- denoising
- probabilistic model
- k means