(computer science) An algorithm for matrix multiplication.

An inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions. It uses dynamic programming to compute the values in two passes, the first going forward in time and the second backward.

(numerical analysis) An algorithm that significantly reduces the numerical error in the total obtained by adding a sequence of finite-precision floating-point numbers, compared to the obvious approach, by tracking the accumulated small errors in a separate variable.

An algorithm for finding a solution to the stable marriage problem in polynomial time.

plural of Bellman-Ford algorithm

Synonym of Ramer-Douglas-Peucker algorithm

A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.

plural of Las Vegas algorithm