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 ( | ) (20 | 50 | 100 | 250 | 500)
  • 11:00, 10 October 2022 Admin talk contribs created page SDD Systems Solvers (Created page with "== Problem Description== In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:...")
  • 11:00, 10 October 2022 Admin talk contribs created page Rod-cutting 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" | Cubic | | |- |...")
  • 11:00, 10 October 2022 Admin talk contribs created page Robotics (Created page with "Robotics is an interdisciplinary field that integrates computer science and engineering. Robotics involves design, construction, operation, and use of robots. The goal of robotics is to design machines that can help and assist humans. Robotics integrates fields of mechanical engineering, electrical engineering, information engineering, mechatronics, electronics, bioengineering, computer engineering, control engineering, software engineering, mathematics, among others. R...")
  • 11:00, 10 October 2022 Admin talk contribs created page Representative Algorithms (Created page with "This is a list of representative algorithms - one algorithm from each family that has gained significant traction and is widely accepted as the common solution to the problem. Please note that the ones listed here might not always be the optimal algorithms. == Algorithms == Bubble Sort Radix Sort Hoare's Selection Algorithm Godbole's DP Algorithm Wagner-Fischer Algorithm Edmonds-Karp Algorithm Strassen's Algorithm Lawler's Graph Colo...")
  • 11:00, 10 October 2022 Admin talk contribs created page Register Allocation (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 | | |- |...")
  • 11:00, 10 October 2022 Admin talk contribs created page Recovery (Created page with "== Problem Description== Database recovery is the process of restoring the database to a correct (consistent) state in the event of a failure. In other words, it is the process of restoring the database to the most recent consistent state that existed shortly before the time of system failure. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:...")
  • 11:00, 10 October 2022 Admin talk contribs created page Ramer–Douglas–Peucker 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...")
  • 11:00, 10 October 2022 Admin talk contribs created page Radix Sort (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...")
  • 11:00, 10 October 2022 Admin talk contribs created page Rabin–Scott Powerset Construction (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...")
  • 11:00, 10 October 2022 Admin talk contribs created page Quadratic Sieve (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...")
  • 11:00, 10 October 2022 Admin talk contribs created page Polynomial interpolation (Created page with "== Problem Description== Polynomial interpolation is a method of estimating values between known data points. When graphical data contains a gap, but data is available on either side of the gap or at a few specific points within the gap, an estimate of values within the gap can be made by interpolation. The simplest method of interpolation is to draw straight lines between the known data points and consider the function as the combination of those straight lines. This m...")
  • 11:00, 10 October 2022 Admin talk contribs created page Polygon clipping (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:59, 10 October 2022 Admin talk contribs created page Point in Polygon (Created page with "== Problem Description== A polygon is a two-dimensional geometric figure that has a finite number of sides. The sides of a polygon are made of straight line segments connected to each other end to end. The line segments of a polygon are called sides or edges. The point where two line segments meet is called vertex or corners, henceforth an angle is formed. An example of a polygon is a triangle with three sides. A circle is also a plane figure but it is not considered a...")
  • 10:59, 10 October 2022 Admin talk contribs created page Parsing (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 | | |- | rowspan="1" | Quadratic...")
  • 10:59, 10 October 2022 Admin talk contribs created page Page replacements (Created page with "== Problem Description== In an operating system that uses paging for memory management, a page replacement algorithm is needed to decide which page needs to be replaced when new page comes in. Page Fault – A page fault happens when a running program accesses a memory page that is mapped into the virtual address space, but not loaded in physical memory. Since actual physical memory is much smaller than virtual memory, page faults happen. In case of page fault, Opera...")
  • 10:59, 10 October 2022 Admin talk contribs created page Operating Systems (Created page with "An operating system (OS) is system software that manages computer hardware, software resources, and provides common services for computer programs. Time-sharing operating systems schedule tasks for efficient use of the system and may also include accounting software for cost allocation of processor time, mass storage, printing, and other resources. For hardware functions such as input and output and memory allocation, the operating system acts as an intermediary betwee...")
  • 10:59, 10 October 2022 Admin talk contribs created page Numerical Analysis (Created page with "Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts. Current growth in computing power has enabled the use of more complex numerical...")
  • 10:59, 10 October 2022 Admin talk contribs created page Non-priority optimal interval Scheduling (Created page with "== Problem Description== Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be executed. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap. For example, the...")
  • 10:59, 10 October 2022 Admin talk contribs created page Nested Loop Join (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:59, 10 October 2022 Admin talk contribs created page Needleman–Wunsch 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:59, 10 October 2022 Admin talk contribs created page Nearest Neighbour (Created page with "== Problem Description== K Nearest Neighbour is a simple algorithm that stores all the available cases and classifies the new data or case based on a similarity measure. It is mostly used to classifies a data point based on how its neighbours are classified. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !w...")
  • 10:59, 10 October 2022 Admin talk contribs created page Nash Equilibria (Created page with "== Problem Description== In game theory, the Nash equilibrium, named after the mathematician John Forbes Nash Jr., is a proposed solution of a non-cooperative game involving two or more players in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy. == Bounds Chart == 350px == Step Chart == File:Nash_EquilibriaStepChart.png|35...")
  • 10:59, 10 October 2022 Admin talk contribs created page NFA to DFA conversion (Created page with "== Problem Description== DFA refers to Deterministic Finite Automaton. A Finite Automata(FA) is said to be deterministic, if corresponding to an input symbol, there is single resultant state i.e. there is only one transition. NFA refers to Nondeterministic Finite Automaton. A Finite Automata(FA) is said to be non deterministic, if there is more than one possible transition from one state on the same input symbol. == Bounds Chart == File:NFA_to_DFA_conversionBoundsC...")
  • 10:59, 10 October 2022 Admin talk contribs created page N-Queens Problem (Created page with "== Problem Description== The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. Generate all possible configurations of queens on board and print a configuration that satisfies the given constraints. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="10...")
  • 10:59, 10 October 2022 Admin talk contribs created page Mutual Exclusion (Created page with "== Problem Description== Mutual exclusion is a property of process synchronization which states that “no two processes can exist in the critical section at any given point of time”. The term was first coined by Djikstra. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Clas...")
  • 10:59, 10 October 2022 Admin talk contribs created page Multiplication (Created page with "== Problem Description== Multiplication is one of the four elementary mathematical operations of arithmetic; with the others being addition; subtraction and division. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lo...")
  • 10:59, 10 October 2022 Admin talk contribs created page Motif Search (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 | | |- | rowspan="1" |...")
  • 10:59, 10 October 2022 Admin talk contribs created page Money Change (Created page with "== Problem Description== Given a value N, if we want to make change for N cents, and we have an infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter. For example, for N = 4 and S = {1,2,3}, there are four solutions: {1,1,1,1},{1,1,2},{2,2},{1,3}. So output should be 4. For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2,2,2,2,2}, {2,2,3,3}, {2,2,6}, {2,3,5} and {5,5}. So the o...")
  • 10:59, 10 October 2022 Admin talk contribs created page Min. Spanning Tree (Created page with "== Problem Description== The cost of the spanning tree is the sum of the weights of all the edges in the tree. There can be many spanning trees. Minimum spanning tree is the spanning tree where the cost is minimum among all the spanning trees. There also can be many minimum spanning trees. Minimum spanning tree has direct application in the design of networks. It is used in algorithms approximating the travelling salesman problem, multi-terminal minimum cut problem and...")
  • 10:59, 10 October 2022 Admin talk contribs created page Maximum subarray 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" | Cubic...")
  • 10:59, 10 October 2022 Admin talk contribs created page Maximum cut (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 | | |- | rowspan="1" | Qu...")
  • 10:59, 10 October 2022 Admin talk contribs created page Maximum cardinality matching (Created page with "== Problem Description== A graph is bipartite if it has two kinds of nodes and the edges are only allowed between nodes of different kind. We write G=(A,B,E) where A and B are the two sets of nodes and E are the edges of G. A matching in a bipartite graph assigns nodes of A to nodes of B. Matchings in bipartite graphs can be computed more efficiently than matchings in general (=non-bipartite) graphs. Interesting Fact: In a bipartite graph the maximum cardinality of a m...")
  • 10:59, 10 October 2022 Admin talk contribs created page Maximum Flow (Created page with "== Problem Description== In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen as a special case of more complex network flow problems, such as the circulation problem. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="...")
  • 10:59, 10 October 2022 Admin talk contribs created page Maximum-weight matching (Created page with "== Problem Description== In computer science, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm...")
  • 10:58, 10 October 2022 Admin talk contribs created page Matrix chain multiplication (Created page with "== Problem Description== Matrix chain multiplication (or Matrix Chain Ordering Problem, MCOP) is an optimization problem that to find the most efficient way to multiply a given sequence of matrices. The problem is not actually to perform the multiplications but merely to decide the sequence of the matrix multiplications involved. The matrix multiplication is associative as no matter how the product is parenthesized, the result obtained will remain the same. For example...")
  • 10:58, 10 October 2022 Admin talk contribs created page Matrix Multiplication (Created page with "== Problem Description== Matrix multiplication or multiplication of matrices is one of the operations that can be performed on matrices in linear algebra. Multiplication of matrix A with matrix B is possible when both the given matrices, A and B are compatible. Matrix multiplication is a binary operation, that gives a matrix from two given matrices. Matrix multiplication was first introduced in 1812 by French mathematician Jacques Philippe Marie Binet, in order to repre...")
  • 10:58, 10 October 2022 Admin talk contribs created page Matrix Factorization for Collaborative Filtering (Created page with "== Problem Description== Matrix factorization is a way to generate latent features when multiplying two different kinds of entities. Collaborative filtering is the application of matrix factorization to identify the relationship between items’ and users’ entities. With the input of users’ ratings on the shop items, we would like to predict how the users would rate the items so the users can get the recommendation based on the prediction. Collaborative Filtering: C...")
  • 10:58, 10 October 2022 Admin talk contribs created page Main Page/index.php (Redirected page to Main Page) Tag: New redirect
  • 10:58, 10 October 2022 Admin talk contribs created page MDPs for optimal policies (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:58, 10 October 2022 Admin talk contribs created page Lowest common ancestor (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:58, 10 October 2022 Admin talk contribs created page Lossy compression (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:58, 10 October 2022 Admin talk contribs created page Longest path on interval graphs (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 | | |- | rowsp...")
  • 10:58, 10 October 2022 Admin talk contribs created page Longest palindromic substring (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="...")
  • 10:58, 10 October 2022 Admin talk contribs created page Longest common subsequence (Created page with "== Problem Description== The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! widt...")
  • 10:58, 10 October 2022 Admin talk contribs created page Logarithm calculations (Created page with "== Problem Description== Logarithms were quickly adopted by scientists because of various useful properties that simplified long, tedious calculations. In particular, scientists could find the product of two numbers m and n by looking up each number’s logarithm in a special table, adding the logarithms together, and then consulting the table again to find the number with that calculated logarithm (known as its antilogarithm). Expressed in terms of common logarithms, th...")
  • 10:58, 10 October 2022 Admin talk contribs created page LogLog 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:58, 10 October 2022 Admin talk contribs created page Link analysis (PAGERANK and variants) (Created page with "== Problem Description== Link analysis is a data analysis technique used in network theory that is used to evaluate the relationships or connections between network nodes. These relationships can be between various types of objects (nodes), including people, organizations and even transactions. Link analysis is essentially a kind of knowledge discovery that can be used to visualize data to allow for better analysis, especially in the context of links, whether Web links...")
  • 10:58, 10 October 2022 Admin talk contribs created page Linear Equations (Created page with "== Problem Description== A linear equation is an equation that is written for two different variables. This equation will be a linear combination of these two variables, and a constant can be present. Surprisingly, when any linear equation is plotted on a graph, it will necessarily produce a straight line - hence the name: Linear equations. A linear equation can be written in different ways. Any simple equation in x and y can be termed as a linear equation if it follow...")
  • 10:58, 10 October 2022 Admin talk contribs created page Line drawing (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 | | |- | rowspan="1" |...")
  • 10:58, 10 October 2022 Admin talk contribs created page Line Intersections (Created page with "== Problem Description== Lines that are non-coincident and non-parallel intersect at a unique point. Lines are said to intersect each other if they cut each other at a point. By Euclid's lemma two lines can have at most 11 point of intersection. To find the intersection of two lines, you first need the equation for each line. At the intersection, xx and yy have the same value for each equation. This means that the equations are equal to each other. We can therefore sol...")
(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:Log"