An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem.
Shengguo LiMing GuLizhi ChengXuebin ChiMeng SunPublished in: SIAM J. Matrix Anal. Appl. (2014)
Keyphrases
- learning algorithm
- np hard
- expectation maximization
- preprocessing
- segmentation algorithm
- search space
- theoretical analysis
- optimal solution
- improved algorithm
- computationally efficient
- computational complexity
- input data
- times faster
- experimental evaluation
- detection algorithm
- optimization algorithm
- high accuracy
- classification algorithm
- cost function
- k means
- experimental study
- memory requirements
- selection algorithm
- single pass
- least squares
- linear programming
- data sets
- computational cost
- dynamic programming
- video sequences
- data structure
- bayesian networks
- neural network