Forcing one-sided results in Goldschmidt algorithm.
Daniel Piso FernandezJavier D. BrugueraPublished in: ACSCC (2008)
Keyphrases
- computational complexity
- dynamic programming
- learning algorithm
- detection algorithm
- selection algorithm
- optimal solution
- experimental evaluation
- matching algorithm
- optimization algorithm
- support vector machine svm
- computationally efficient
- recognition algorithm
- worst case
- preprocessing
- data sets
- improved algorithm
- hardware implementation
- space complexity
- single pass
- theoretical analysis
- linear programming
- k means
- segmentation algorithm
- expectation maximization
- maximum likelihood
- simulated annealing
- computational cost
- estimation algorithm
- bayesian networks