On the tractability of the Brownian Bridge algorithm.
Gerhard LarcherGunther LeobacherKlaus ScheicherPublished in: J. Complex. (2003)
Keyphrases
- computational complexity
- experimental evaluation
- computationally efficient
- high accuracy
- computational cost
- cost function
- times faster
- detection algorithm
- np hard
- linear programming
- worst case
- learning algorithm
- segmentation algorithm
- matching algorithm
- theoretical analysis
- recognition algorithm
- improved algorithm
- single pass
- simulated annealing
- k means
- search space
- feature selection
- particle swarm optimization
- expectation maximization
- knn
- mobile robot
- multi objective
- evolutionary algorithm
- preprocessing
- estimation algorithm