All public logs

Jump to navigation Jump to search

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

Logs
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
  • 10:55, 10 October 2022 Admin talk contribs created page Discrete Fourier Transform (Created page with "== Problem Description== In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| cl...")
  • 10:55, 10 October 2022 Admin talk contribs created page Discovering multivalued dependencies (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | |...")
  • 10:55, 10 October 2022 Admin talk contribs created page Dijkstra's Algorithm (Created page with "== Algorithm Details == Year : 1956 Family : Shortest Path(Directed graphs) Authors : Edsger W. Dijkstra Paper Link : http://www-m3.ma.tum.de/foswiki/pub/MN0506/WebHome/dijkstra.pdf Time Complexity : == Problem Statement == The Single-Source Shortest Path (SSSP) problem consists of finding the shortest paths between a given vertex v and all other vertices in the graph. == PseudoCode == 1 function Dijkstra(Graph, source): 2 3 create vertex set Q 4 5...")
  • 10:55, 10 October 2022 Admin talk contribs created page Digraph realization problem (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" |...")
  • 10:55, 10 October 2022 Admin talk contribs created page Dependency inference problem (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1"...")
  • 10:55, 10 October 2022 Admin talk contribs created page Delaunay triangulation (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | |...")
  • 10:55, 10 October 2022 Admin talk contribs created page Dekker's Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:55, 10 October 2022 Admin talk contribs created page Decade Analysis (Created page with "This analysis presents the average annualized improvement rate for problem sizes of 1 thousand, 1 million, and 1 billion and contrasts them with the average improvement rate in hardware as measured by the SPECInt benchmark.\cite{CompArch} As these graphs show, there are two large clusters of algorithm families and then some intermediate values. The first cluster, representing just under half the families, shows little to no improvement even for large problem sizes. Th...")
  • 10:55, 10 October 2022 Admin talk contribs created page Deadlock avoidance (Created page with "== Problem Description== The deadlock Avoidance method is used by the operating system in order to check whether the system is in a safe state or in an unsafe state and in order to avoid the deadlocks, the process must need to tell the operating system about the maximum number of resources a process can request in order to complete its execution. == Bounds Chart == 1050px == Step Chart == File:Deadlock_avoidanceStepChart.png...")
  • 10:55, 10 October 2022 Admin talk contribs created page De Bruijn Graph (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:55, 10 October 2022 Admin talk contribs created page Databases (Created page with "In computing, a database is an organized collection of data stored and accessed electronically from a computer system. Where databases are more complex they are often developed using formal design and modeling techniques. The database management system (DBMS) is the software that interacts with end users, applications, and the database itself to capture and analyze the data. The DBMS software additionally encompasses the core facilities provided to administer the databa...")
  • 10:55, 10 October 2022 Admin talk contribs created page DFA Minimization (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | | |- | rowspa...")
  • 10:55, 10 October 2022 Admin talk contribs created page DE NOVO GENOME ASSEMBLY (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic |...")
  • 10:55, 10 October 2022 Admin talk contribs created page Cyclopeptide sequencing (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic |...")
  • 10:55, 10 October 2022 Admin talk contribs created page Cycle Detection (Created page with "== Problem Description== cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Li...")
  • 10:55, 10 October 2022 Admin talk contribs created page Cryptography (Created page with "Cryptography is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages; various aspects in information security such as data confidentiality, data integrity, authentication, and non-repudiation are central to modern cryptography. Modern cryptography exists at the intersection of t...")
  • 10:55, 10 October 2022 Admin talk contribs created page Cryptanalysis of Linear Feedback Shift Registers (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="...")
  • 10:55, 10 October 2022 Admin talk contribs created page Coset Enumeration (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | | |- | rows...")
  • 10:54, 10 October 2022 Admin talk contribs created page Convex Hull (Created page with "== Problem Description== The Convex Hull is the line completely enclosing a set of points in a plane so that there are no concavities in the line. More formally, we can describe it as the smallest convex polygon which encloses a set of points such that each point in the set lies within the polygon or on its perimeter. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class...")
  • 10:54, 10 October 2022 Admin talk contribs created page Constructing suffix trees (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cub...")
  • 10:54, 10 October 2022 Admin talk contribs created page Constructing Eulerian trails in a Graph (Created page with "== Problem Description== In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. == Bounds Chart == 350px == Step Chart == 350px == Impr...")
  • 10:54, 10 October 2022 Admin talk contribs created page Constants (Created page with "In our research, we have approximated the number of steps that an algorithm needs to perform by looking at its asymptotic complexity, which drops any leading constants or smaller-order terms.For any reasonable problem sizes, simplifying to the highest order term is likely to be a good approximation. But dropping the leading constant may be worrisome if complexity class improvements come with inflation in the size of the leading constant. One particularly important exampl...")
  • 10:54, 10 October 2022 Admin talk contribs created page Computer Networking (Created page with "A computer network is a set of computers sharing resources located on or provided by network nodes. The computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are made up of telecommunication network technologies, based on physically wired, optical, and wireless radio-frequency methods that may be arranged in a variety of network topologies. The nodes of a computer network may include personal co...")
  • 10:54, 10 October 2022 Admin talk contribs created page Cohen–Sutherland Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Closest Pair Problem (Created page with "== Problem Description== We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. == Bounds Chart == File:Closest_Pair_ProblemBoundsChart.png|1050...")
  • 10:54, 10 October 2022 Admin talk contribs created page Chatlin's Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bubble Sort (Created page with "== Algorithm Details == Year : 1956 Family : Sorting - Comparison Authors : NA Paper Link : NA Time Complexity : == Problem Statement == Bubble sort is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order. This algorithm is not suitable for large data sets as its average and worst case complexity are quadratic where n is the numb...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bruun's FFT Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bron–Kerbosch Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bresenham's Line Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bowyer–Watson Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page BioInformatics (Created page with "Bioinfromatics an interdisciplinary field that develops methods and software tools for understanding biological data, in particular when the data sets are large and complex. As an interdisciplinary field of science, bioinformatics combines biology, computer science, information engineering, mathematics and statistics to analyze and interpret the biological data. Bioinformatics has been used for in silico analyses of biological queries using mathematical and statistical t...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bentley-Ottmann Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page Bellman-Ford Algorithm (Created page with "== Algorithm Details == Year : -150 Family : SDD Systems Solvers Authors : Carl Friedrich Gauss Paper Link : NA Time Complexity : == Problem Statement == In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square ma...")
  • 10:54, 10 October 2022 Admin talk contribs created page BCNF Decomposition (Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- | rowspan="1" | Cubic | | |- | ro...")
  • 10:54, 10 October 2022 Admin talk contribs created page All permutations (Created page with "== Problem Description== All permutations of an input string. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="1" | Polynomial > 3 | | |- |...")
  • 10:54, 10 October 2022 Admin talk contribs created page All-pairs shortest paths (Undirected) (Created page with "== Problem Description== It aims to figure out the shortest path from each vertex v to every other u. Storing all the paths explicitly can be very memory expensive indeed, as we need one spanning tree for each vertex. This is often impractical regarding memory consumption, so these are generally considered as all pairs-shortest distance problems, which aim to find just the distance from each to each node to another. We usually want the output in tabular form: the entry i...")
  • 10:53, 10 October 2022 Admin talk contribs created page Algorithm Families (Created page with "query")
  • 10:53, 10 October 2022 Admin talk contribs created page About Algorithm-Wiki (Created page with "query")
  • 10:53, 10 October 2022 Admin talk contribs created page ADI Iteration (Created page with "query")
  • 10:53, 10 October 2022 Admin talk contribs created page A* Informed Search (Created page with "query")
  • 10:53, 10 October 2022 Admin talk contribs created page A* Algorithm (Created page with "query")
  • 10:53, 10 October 2022 Admin talk contribs created page 4 - Graph Coloring (Created page with "query")
  • 10:52, 10 October 2022 Admin talk contribs created page 4NF decomposition (Created page with "query")
  • 10:52, 10 October 2022 Admin talk contribs created page 3 - Graph Coloring (Created page with "query")
  • 14:15, 7 October 2022 Admin talk contribs created page File:Hh2.png
  • 14:15, 7 October 2022 Admin talk contribs uploaded File:Hh2.png
  • 13:21, 7 October 2022 Admin talk contribs imported Main Page by file upload (1 revision)
  • 12:32, 7 October 2022 MediaWiki default talk contribs created page Main Page Tag: Reverted
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:Log"