A Remez-type algorithm for the calculation of extremal fundamental systems for polynomial spaces on teh sphere.
Manfred ReimerBurkhard SündermannPublished in: Computing (1986)
Keyphrases
- improved algorithm
- optimal solution
- computational complexity
- learning algorithm
- high accuracy
- times faster
- optimization algorithm
- dynamic programming
- recognition algorithm
- selection algorithm
- preprocessing
- search space
- significant improvement
- experimental evaluation
- segmentation algorithm
- matching algorithm
- detection algorithm
- polynomially bounded
- computational cost
- np hard
- cost function
- k means
- objective function
- simulated annealing
- distributed systems
- expert systems
- search algorithm
- data structure
- image segmentation