New bounds and efficient algorithm for sparse difference resultant.
Chun-Ming YuanZhi-Yong ZhangPublished in: CoRR (2018)
Keyphrases
- single pass
- computationally efficient
- worst case
- computational cost
- learning algorithm
- search space
- times faster
- preprocessing
- similarity measure
- improved algorithm
- detection algorithm
- experimental evaluation
- cost function
- significant improvement
- objective function
- probabilistic model
- upper bound
- motion estimation
- theoretical guarantees
- np hard
- tree structure
- recognition algorithm
- confidence bounds
- sparse matrix
- reinforcement learning
- error bounds
- sparse representation
- linear programming
- high accuracy
- dynamic programming