Share This
table started by
Freebase Web Team for the computer Base
There is no user-contributed description yet.
Add More Topics
Save this view to a base, or just for yourself.
23 Algorithm Family topics matching:
Filter this Collection| x name | x image | x Algorithm | x article |
|---|---|---|---|
| x Graph theory | Graph theory |
In mathematics and computer science, graph theory is the study of graphs: mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and...
|
|
| Bellman-Ford algorithm | |||
| Dijkstra's algorithm | |||
| Perturbation theory | |||
| Floyd-Warshall algorithm | |||
| more ▼ | |||
| x Search algorithm | Linear search |
In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer...
|
|
| Selection algorithm | |||
| Binary search algorithm | |||
| Binary search tree | |||
| Breadth-first search | |||
| more ▼ | |||
| x String searching algorithm |
|
Aho-Corasick algorithm |
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.
Let Σ be an...
|
| Bitap algorithm | |||
| Boyer–Moore string search algorithm | |||
| Knuth–Morris–Pratt algorithm | |||
| Rabin-Karp string search algorithm | |||
| more ▼ | |||
| x Sorting algorithm |
|
Binary search tree |
In computer science and mathematics, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important to optimizing the use of...
|
| Bogosort | |||
| Bubble sort | |||
| Bucket sort | |||
| Cocktail sort | |||
| more ▼ | |||
| x Merge algorithm |
Merge algorithms are a family of algorithms that run sequentially over multiple sorted lists, typically producing more sorted lists as output. This is well-suited for machines with tape drives. Use has declined due to large random access memories,...
|
||
| x Data compression | Burrows-Wheeler transform |
In computer science and information theory, data compression or source coding is the process of encoding information using fewer bits (or other information-bearing units) than an unencoded representation would use, through use of specific encoding...
|
|
| DEFLATE | |||
| Delta encoding | |||
| Incremental encoding | |||
| LZW | |||
| more ▼ | |||
| x Computational geometry |
|
Fortune's Algorithm |
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are...
|
| Collision detection | |||
| Convex hull algorithms | |||
| Chan's algorithm | |||
| Gift wrapping algorithm | |||
| more ▼ | |||
| x Computer vision |
|
Computer vision is the science and technology of machines that see. As a scientific discipline, computer vision is concerned with the theory for building artificial systems that obtain information from images. The image data can take many forms,...
|
|
| x Cryptography |
|
Symmetric-key algorithm |
Cryptography (or cryptology; from Greek κρυπτός, kryptos, "hidden, secret"; and γράφω, gráphō, "I write", or -λογία, -logia, respectively) is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics...
|
| Advanced Encryption Standard | |||
| Blowfish | |||
| Data Encryption Standard | |||
| International Data Encryption Algorithm | |||
| more ▼ | |||
| x Digital signal processing |
|
CORDIC |
Digital signal processing (DSP) is concerned with the representation of the signals by a sequence of numbers or symbols and the processing of these signals. Digital signal processing and analog signal processing are subfields of signal processing....
|
| Rainflow-counting algorithm | |||
| Osem | |||
| Goertzel algorithm | |||
| Discrete Fourier transform | |||
| more ▼ | |||
| x Software Engineering |
|
Algorithms for Recovery and Isolation Exploiting Semantics |
Software engineering is the application of a systematic, disciplined, quantifiable approach to the development, operation, and maintenance of software, and the study of these approaches; that is, the application of engineering to software.
The term...
|
| Unicode collation algorithm | |||
| CHS conversion | |||
| Cyclic redundancy check | |||
| Parity bit | |||
| more ▼ | |||
| x Distributed computing | Happened-before |
Distributed computing is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to...
|
|
| Snapshot algorithm | |||
| Vector clocks | |||
| Marzullo's algorithm | |||
| Intersection algorithm | |||
| more ▼ | |||
| x Operating system |
|
Banker's algorithm |
An operating system (OS) is an interface between hardware and user which is responsible for the management and coordination of activities and the sharing of the resources of the computer that acts as a host for computing applications run on the...
|
| Page replacement algorithm | |||
| Bully algorithm | |||
| Elevator algorithm | |||
| Shortest seek first | |||
| more ▼ | |||
| x Scheduling |
|
Rate-monotonic scheduling |
Scheduling is a key concept in computer multitasking and multiprocessing operating system design, and in real-time operating system design. In modern operating systems, there are typically many more processes running than there are CPUs available to...
|
| Earliest deadline first scheduling | |||
| Fair-share scheduling | |||
| Round-robin scheduling | |||
| Shortest job next | |||
| more ▼ | |||
| x Neural network |
|
Traditionally, the term neural network had been used to refer to a network or circuit of biological neurons. The modern usage of the term often refers to artificial neural networks, which are composed of artificial neurons or nodes. Thus the term...
|
|
| x Number theory |
|
Discrete logarithm |
Number theory is the branch of pure mathematics concerned with the properties of numbers in general, and integers in particular, as well as the wider classes of problems that arise from their study.
Number theory may be subdivided into several...
|
| Baby-step giant-step | |||
| Pollard's rho algorithm for logarithms | |||
| Pohlig–Hellman algorithm | |||
| Index calculus algorithm | |||
| more ▼ | |||
| x Numerical analysis |
|
Biconjugate gradient method |
Numerical analysis is the study of algorithms for the problems of continuous mathematics (as distinguished from discrete mathematics).
One of the earliest mathematical writings is the Babylonian tablet YBC 7289, which gives a sexagesimal numerical...
|
| Borwein's algorithm | |||
| Dancing Links | |||
| De Boor's algorithm | |||
| De Casteljau's algorithm | |||
| more ▼ | |||
| x Optimization |
|
Ant colony optimization |
In mathematics and computer science, optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives.
In the simplest case, this means solving problems in which one seeks to minimize or maximize...
|
| BFGS method | |||
| Branch and bound | |||
| Matrix chain multiplication | |||
| Conjugate gradient method | |||
| more ▼ | |||
| x Parsing |
|
Recursive descent parser |
In computer science and linguistics, parsing, or, more formally, syntactic analysis, is the process of analyzing a text, made of a sequence of tokens (for example, words), to determine its grammatical structure with respect to a given (more or less)...
|
| LL parser | |||
| LR parser | |||
| Operator-precedence parser | |||
| Simple LR parser | |||
| more ▼ | |||
| x Quantum computer | Grover's algorithm |
A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. The basic principle behind quantum computation is that quantum properties...
|
|
| Shor's algorithm | |||
| Deutsch-Jozsa algorithm | |||
| x Combinatorics |
|
Floyd's cycle-finding algorithm |
Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. It is related to many other areas of mathematics, such as algebra, probability theory, ergodic theory and geometry, as well as to applied...
|
| Pseudorandom number generator | |||
| Blum-Blum-Shub pseudorandom number generator | |||
| Mersenne twister | |||
| Lagged Fibonacci generator | |||
| more ▼ | |||
| x Join | Hash join |
An SQL JOIN clause combines records from two or more tables in a database. It creates a set that can be saved as a table or used as is. A JOIN is a means for combining fields from two tables by using values common to each. ANSI standard SQL...
|
|
| Nested loop join | |||
| Sort-merge join | |||
| Block nested loop | |||
| x Computer graphics (computer science) |
|
Bresenham's line algorithm |
Computer graphics is a sub-field of computer science which studies methods for digitally synthesizing and manipulating visual content. Although the term often refers to the study of three-dimensional computer graphics, it also encompasses two...
|
| Line drawing algorithm | |||
| Digital Differential Analyzer | |||
| Flood fill | |||
| Xiaolin Wu's line algorithm | |||
| more ▼ | |||
