A linear algorithm for the identification of a weakly singular relaxation kernel using two boundary measurements.
Sergei A. AvdoninLuciano PandolfiPublished in: CoRR (2016)
Keyphrases
- detection algorithm
- closed form
- k means
- worst case
- improved algorithm
- dynamic programming
- objective function
- search space
- cost function
- linear complexity
- iterative algorithms
- optimization algorithm
- segmentation algorithm
- particle swarm optimization
- identification rate
- convex hull
- learning algorithm
- probabilistic model
- computational cost
- preprocessing
- optimal solution
- geometrical properties
- boolean expressions
- decision trees
- similarity measure
- globally optimal
- bayesian networks
- convergence rate
- simulated annealing
- matching algorithm
- clustering method
- significant improvement
- expectation maximization
- neural network