New bounds and an efficient algorithm for sparse difference resultants.
Chun-Ming YuanZhi-Yong ZhangPublished in: J. Symb. Comput. (2021)
Keyphrases
- computational complexity
- k means
- high accuracy
- experimental evaluation
- learning algorithm
- detection algorithm
- theoretical guarantees
- computational cost
- times faster
- matching algorithm
- computationally efficient
- linear programming
- worst case
- dynamic programming
- preprocessing
- np hard
- improved algorithm
- recognition algorithm
- cost function
- error bounds
- expectation maximization
- optimal solution
- data sets
- genetic algorithm
- average case
- randomized algorithm
- particle swarm optimization
- least squares
- probabilistic model
- significant improvement
- high dimensional
- objective function