An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups.
Vijay V. VaziraniHuzur SaranB. Sundar RajanPublished in: FOCS (1996)
Keyphrases
- computationally efficient
- optimization algorithm
- dynamic programming
- single pass
- detection algorithm
- theoretical analysis
- cost function
- high accuracy
- learning algorithm
- matching algorithm
- experimental evaluation
- worst case
- np hard
- k means
- segmentation algorithm
- preprocessing
- objective function
- recognition algorithm
- improved algorithm
- data sets
- optimal solution
- shortest path
- path planning
- highly efficient
- memory efficient