On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing.
Michele FlamminiMordechai ShalomShmuel ZaksPublished in: J. Parallel Distributed Comput. (2007)
Keyphrases
- preprocessing
- tight bounds
- computational complexity
- dynamic programming
- learning algorithm
- optimal solution
- optimization algorithm
- theoretical analysis
- search space
- np hard
- neural network
- cost function
- objective function
- upper bound
- memory requirements
- detection algorithm
- single scan
- space complexity
- improved algorithm
- times faster
- worst case
- small number
- probabilistic model
- k means
- expectation maximization
- segmentation algorithm
- input data
- linear programming
- clustering method
- matching algorithm
- high accuracy
- convergence rate
- recognition algorithm
- computational effort
- execution times
- computational cost