Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator.
Martin L. GrissPublished in: IEEE Trans. Computers (1978)
Keyphrases
- theoretical analysis
- optimal solution
- detection algorithm
- computationally efficient
- improved algorithm
- learning algorithm
- worst case
- significant improvement
- preprocessing
- computational complexity
- times faster
- cost function
- recognition algorithm
- computational cost
- high accuracy
- objective function
- classification algorithm
- graph structure
- particle swarm optimization
- experimental evaluation
- dynamic programming
- np hard
- highly efficient
- polynomially bounded
- polynomial delay
- segmentation algorithm
- k means
- high dimensional
- feature selection