- Sektör: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices.
Industry:Computer science
Find the longest substring of two or more strings.
Industry:Computer science
Find the maximum of a set of n elements in ⌈log n⌉ "rounds" (passes) by "playing" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round. It takes n-1 comparisons, like linear search, but may be parallelized, extended to also find the second greatest element, etc.
Industry:Computer science
Find the point (rectangle, line, etc.) that is closest to another point.
Industry:Computer science
Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.
Industry:Computer science
Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph. Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.
Industry:Computer science
Find the shortest string that contains two or more strings as subsequences.
Industry:Computer science
Find the shortest string that contains two or more strings as substrings.
Industry:Computer science
Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes O(n log n) time.
Industry:Computer science
Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph.
Industry:Computer science
