Theoretical relationships between potential operands and basic measurable properties of algorithm structure.
S. K. BandyopadhyayPublished in: ACM SIGPLAN Notices (1981)
Keyphrases
- learning algorithm
- theoretical analysis
- k means
- structural properties
- preprocessing
- experimental evaluation
- np hard
- improved algorithm
- matching algorithm
- high accuracy
- simulated annealing
- dynamic programming
- significant improvement
- lattice structure
- similarity measure
- recognition algorithm
- objective function
- classification algorithm
- tree structure
- segmentation algorithm
- computationally efficient
- search space
- probabilistic model
- cost function
- computational complexity
- optimization algorithm
- ant colony optimization
- graphical models
- genetic algorithm
- times faster
- denoising
- graph structure
- image processing
- single pass