Variable Latency Rounding for Golschmidt Algorithm with Parallel Remainder Estimation.
Daniel Piso FernandezJavier D. BrugueraPublished in: DSD (2009)
Keyphrases
- dynamic programming
- estimation algorithm
- linear programming
- np hard
- learning algorithm
- times faster
- computational cost
- experimental evaluation
- preprocessing
- cost function
- k means
- parallel implementation
- genetic algorithm
- detection algorithm
- optimization algorithm
- density estimation
- multiprocessor systems
- particle swarm optimization
- significant improvement
- computational complexity
- objective function
- theoretical analysis
- segmentation algorithm
- parameter estimation
- computationally efficient
- matching algorithm
- kalman filter
- worst case
- approximation algorithms
- recognition algorithm
- mobile robot
- estimation accuracy
- depth first search