A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance.
Philippe DelsarteYves V. GeninYves G. KampPublished in: IEEE Trans. Inf. Theory (1983)
Keyphrases
- np hard
- optimization algorithm
- experimental evaluation
- learning algorithm
- detection algorithm
- cost function
- k means
- distance transform
- high accuracy
- preprocessing
- significant improvement
- times faster
- improved algorithm
- computationally efficient
- theoretical analysis
- clustering method
- matching algorithm
- polynomially bounded
- dynamic programming
- search space
- computational complexity
- bayesian networks
- clustering algorithm
- distance function
- tree structure
- similarity measure
- feature selection