Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm.
Palash SarkarPublished in: Adv. Math. Commun. (2024)
Keyphrases
- preprocessing
- experimental evaluation
- improved algorithm
- detection algorithm
- learning algorithm
- cost function
- computationally efficient
- dynamic programming
- optimization algorithm
- times faster
- k means
- np hard
- computational cost
- selection algorithm
- hardware implementation
- similarity measure
- single pass
- high accuracy
- optimal solution
- input data
- memory efficient
- matching algorithm
- path planning
- estimation algorithm
- convex hull
- recognition algorithm
- simulated annealing
- segmentation algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- linear programming
- worst case
- scheduling problem
- mobile robot
- significant improvement
- computational complexity
- search algorithm
- video sequences
- objective function
- image segmentation