A polynomial-time algorithm for computing low CP-rank decompositions.
Khaled M. ElbassioniTrung Thanh NguyenPublished in: Inf. Process. Lett. (2017)
Keyphrases
- computational complexity
- dynamic programming
- detection algorithm
- computational cost
- improved algorithm
- objective function
- experimental evaluation
- times faster
- optimization algorithm
- worst case
- cost function
- learning algorithm
- np hard
- preprocessing
- theoretical analysis
- expectation maximization
- significant improvement
- probabilistic model
- upper bound
- search space
- high accuracy
- input data
- k means
- computationally efficient
- neural network
- data structure
- optimal solution
- recognition algorithm
- special case