Lanczos-like algorithm for the time-ordered exponential: The *-inverse problem.
Pierre-Louis GiscardStefano PozzaPublished in: CoRR (2019)
Keyphrases
- learning algorithm
- times faster
- theoretical analysis
- k means
- np hard
- probabilistic model
- computational complexity
- preprocessing
- significant improvement
- computational cost
- particle swarm optimization
- computationally efficient
- experimental evaluation
- cost function
- segmentation algorithm
- detection algorithm
- convex hull
- selection algorithm
- linear programming
- worst case
- search space
- expectation maximization
- input data
- optimization algorithm
- search algorithm
- classification algorithm
- matching algorithm
- path planning
- optimal solution
- objective function
- memory requirements
- convergence rate
- similarity measure