Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm.
Bruno O. ShubertCalvin Marion AndersonPublished in: IEEE Trans. Inf. Theory (1973)
Keyphrases
- learning algorithm
- experimental evaluation
- dynamic programming
- similarity measure
- memory requirements
- cost function
- matching algorithm
- preprocessing
- detection algorithm
- probabilistic model
- worst case
- times faster
- classification algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- computational cost
- np hard
- black box
- memory usage
- convergence rate
- recognition algorithm
- memory space
- memory size
- optimization algorithm
- linear programming
- significant improvement
- k means
- search space
- computational complexity
- optimal solution