User contributions for Admin

Jump to navigation Jump to search
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)

15 February 2023

  • 11:2311:23, 15 February 2023 diff hist +1,387‎ N Decisional BCNF ‎ Created page with "{{DISPLAYTITLE:Decisional BCNF (BCNF Decomposition)}} == Description == Decisional BCNF is the problem of deciding whether or not a relation schema can be turned into Boyce-Codd normal form (BCNF). A relation schema $R$ is in Boyce Codd Normal Form (abbr. BCNF) if for all non-trivial FDs $X \rightarrow Y$ in $F^+$, $X$ is a superkey. In extending this notion to database schemas, we must be conscious of the UR-assumption. We say that $R_i = <ATTR_i,F_i>$ is in BCNF if..."
  • 11:2211:22, 15 February 2023 diff hist +32‎ N Boyce-Codd Normal Form Decomposition ‎ Redirected page to BCNF Decomposition current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +377‎ BCNF Decomposition ‎No edit summary
  • 11:2211:22, 15 February 2023 diff hist +2,447‎ N Multivalued Dependency Inference Problem ‎ Created page with "{{DISPLAYTITLE:Multivalued Dependency Inference Problem (Dependency Inference Problem)}} == Description == The multivalued dependency inference problem is to find a cover for the set of multivalued dependencies that hold in a given relation. A multivalued dependency (abbr. MVD), $g$, on a set of attributes $U$ is a statement $g: X \rightarrow \rightarrow Y$, where $X$ and $Y$ are subsets of $U$. Let $Z$ be the complement of the union of $X$ and $Y$ in $U$. A relation..."
  • 11:2211:22, 15 February 2023 diff hist +2,275‎ N Functional Dependency Inference Problem ‎ Created page with "{{DISPLAYTITLE:Functional Dependency Inference Problem (Dependency Inference Problem)}} == Description == The functional dependency inference problem is to find a cover for the set of functional dependencies that hold in a given relation. A functional dependency (abbr. FD), $f$, is a statement $f: X \rightarrow Y$ where $X$ and $Y$ are sets of attributes. If $R(X, Y, \ldots)$ is a relation on a set of attributes that contains $X$ and $Y$, then $R$ obeys the FD $f$ if..."
  • 11:2211:22, 15 February 2023 diff hist +5,060‎ N Subset Sum ‎ Created page with "{{DISPLAYTITLE:Subset Sum (The Subset-Sum Problem)}} == Description == Given a set $S$ of integers and a target sum $t$, determine whether there is a subset of $S$ that sum to $t$. == Parameters == <pre>S: the set of integers n: the number of integers in the set n': the number of distinct elements in the set t: the target sum σ: sum of elements in the set</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Na..."
  • 11:2211:22, 15 February 2023 diff hist +2,169‎ N De Novo Genome Assembly ‎ Created page with "{{DISPLAYTITLE:De Novo Genome Assembly (De Novo Genome Assembly)}} == Description == De novo sequencing refers to sequencing a novel genome where there is no reference sequence available for alignment. Sequence reads are assembled as contigs, and the coverage quality of de novo sequence data depends on the size and continuity of the contigs (ie, the number of gaps in the data). == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable so..."
  • 11:2211:22, 15 February 2023 diff hist +1,413‎ N Delaunay Triangulation ‎ Created page with "{{DISPLAYTITLE:Delaunay Triangulation (Delaunay Triangulation)}} == Description == Given a set of points, the Delaunay Triangulation problem is to triangulate the points using the following notion of triangulation. $AB$ is an edge of the Delaunay triangulation iff there is a circle passing through $A$ and $B$ so that all other points in the point set, $C$, where $C$ is not equal to $A$ or $B$, lie outside the circle. Equivalently, all triangles in the Delaunay triangu..."
  • 11:2211:22, 15 February 2023 diff hist −681‎ Three-dimensional elliptic partial differential equations ‎ Redirected page to 3-Dimensional Poisson Problem current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +3,043‎ N 3-Dimensional Poisson Problem ‎ Created page with "{{DISPLAYTITLE:3-Dimensional Poisson Problem (Poisson Problem)}} == Description == Given $f$, solve for $u$ in the 3-dimensional Poisson equation: $u_{xx} + u_{yy} + u_{zz} = f(x,y,z)$ == Related Problems == Related: 2-Dimensional Poisson Problem == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Referenc..."
  • 11:2211:22, 15 February 2023 diff hist +43‎ N Two-dimensional elliptic partial differential equations ‎ Redirected page to 2-Dimensional Poisson Problem current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +3,032‎ N 2-Dimensional Poisson Problem ‎ Created page with "{{DISPLAYTITLE:2-Dimensional Poisson Problem (Poisson Problem)}} == Description == Given $f$, solve for $u$ in the 2-dimensional Poisson equation: $u_{xx} + u_{yy} = f(x,y)$ == Related Problems == Related: 3-Dimensional Poisson Problem == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | ..."
  • 11:2211:22, 15 February 2023 diff hist +2,388‎ N Approximate TSP ‎ Created page with "{{DISPLAYTITLE:Approximate TSP (The Traveling-Salesman Problem)}} == Description == Approximate TSP is the problem of finding an approximate answer to Minimum TSP. In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP...."
  • 11:2211:22, 15 February 2023 diff hist +1,365‎ N Maximum TSP ‎ Created page with "{{DISPLAYTITLE:Maximum TSP (The Traveling-Salesman Problem)}} == Description == In Maximum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that maximizes the length of the tour. == Related Problems == Related: Minimum TSP, Approximate TSP == Parameters == <pre>V: number of cities (nodes..."
  • 11:2211:22, 15 February 2023 diff hist +25‎ N TSP ‎ Redirected page to Minimum TSP current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +2,858‎ N Minimum TSP ‎ Created page with "{{DISPLAYTITLE:Minimum TSP (The Traveling-Salesman Problem)}} == Description == In Minimum TSP, you are given a set $C$ of cities and distances between each distinct pair of cities. The goal is to find an ordering or tour of the cities, such that you visit each city exactly once and return to the origin city, that minimizes the length of the tour. This is the typical variation of TSP. == Related Problems == Related: Maximum TSP, Approximate TSP == Parameter..."
  • 11:2211:22, 15 February 2023 diff hist +1,344‎ N Max-Weight k-Clique ‎ Created page with "{{DISPLAYTITLE:Max-Weight k-Clique (Clique Problems)}} == Description == Given a graph $G = (V, E)$, find the $k$-clique of maximum weight. == Related Problems == Generalizations: k-Clique Related: Enumerating Maximal Cliques, arbitrary graph, Exact k-Clique, Min-Weight k-Clique == Parameters == <pre>n: number of vertices k: size of clique</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reduct..."
  • 11:2211:22, 15 February 2023 diff hist +1,103‎ N Min-Weight k-Clique ‎ Created page with "{{DISPLAYTITLE:Min-Weight k-Clique (Clique Problems)}} == Description == Given a graph $G = (V, E)$, find the $k$-clique of minimum weight. == Related Problems == Generalizations: k-Clique Related: Enumerating Maximal Cliques, arbitrary graph, Exact k-Clique, Max-Weight k-Clique == Parameters == <pre>n: number of vertices k: size of clique</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reduct..."
  • 11:2211:22, 15 February 2023 diff hist +456‎ N Exact k-Clique ‎ Created page with "{{DISPLAYTITLE:Exact k-Clique (Clique Problems)}} == Description == Given a graph $G = (V, E)$, find a $k$-clique of weight 0. == Related Problems == Generalizations: k-Clique Related: Enumerating Maximal Cliques, arbitrary graph, Min-Weight k-Clique, Max-Weight k-Clique == Parameters == <pre>n: number of vertices k: size of clique</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem."
  • 11:2211:22, 15 February 2023 diff hist +2,220‎ N K-Clique ‎ Created page with "{{DISPLAYTITLE:k-Clique (Clique Problems)}} == Description == For a constant $k \geq 3$, the $k$-Clique problem is as follows: given a graph $G = (V, E)$ on $n$ vertices, does $G$ contain $k$ distinct vertices $a_1, \ldots, a_k$ so that for every $(i, j)$, $i \neq j$, $(a_i, a_j ) \in E$? Such a $k$ node graph is called a $k$-clique. == Related Problems == Subproblem: Exact k-Clique, Min-Weight k-Clique, Max-Weight k-Clique Related: Enumerating Maxi..."
  • 11:2211:22, 15 February 2023 diff hist +4,069‎ N Enumerating Maximal Cliques, arbitrary graph ‎ Created page with "{{DISPLAYTITLE:Enumerating Maximal Cliques, arbitrary graph (Clique Problems)}} == Description == A maximal clique (complete subgraph) is a clique that is not contained in any other clique. The goal here is to enumerate such maximal cliques in a given graph. == Related Problems == Related: k-Clique, Exact k-Clique, Min-Weight k-Clique, Max-Weight k-Clique == Parameters == <pre>n: number of vertices m: number of edges</pre> == Table of Algorithms..."
  • 11:2211:22, 15 February 2023 diff hist +2,809‎ N Inexact GED ‎ Created page with "{{DISPLAYTITLE:Inexact GED (Graph Edit Distance Computation)}} == Description == The GED of two graphs is defined as the minimum cost of an edit path between them, where an edit path is a sequence of edit operations (inserting, deleting, and relabeling vertices or edges) that transforms one graph into another. Inexact GED computes an answer that is not gauranteed to be the exact GED. == Related Problems == Related: Exact GED == Parameters == <pre>V: number of..."
  • 11:2211:22, 15 February 2023 diff hist +23‎ N GED Computation ‎ Redirected page to Exact GED current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +1,822‎ N Exact GED ‎ Created page with "{{DISPLAYTITLE:Exact GED (Graph Edit Distance Computation)}} == Description == The GED of two graphs is defined as the minimum cost of an edit path between them, where an edit path is a sequence of edit operations (inserting, deleting, and relabeling vertices or edges) that transforms one graph into another. Exact GED computes the GED exactly. == Related Problems == Related: Inexact GED == Parameters == <pre>V: number of vertices in the larger of the two grap..."
  • 11:2211:22, 15 February 2023 diff hist +1,264‎ N Lowest Common Ancestors with Linking and Cutting ‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestors with Linking and Cutting (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, the queries are on-line. Interspersed with the queries are on-line commands of two types: $link(x, y)$, where $y$ but not necessarily $x$ is a tree root, and $cut (x)$, where $x$ is not a root. The effect..."
  • 11:2211:22, 15 February 2023 diff hist +1,747‎ N Lowest Common Ancestor with Linking ‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestor with Linking (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, the queries are on-line. Interspersed with the queries are on-line commands $link(x, y)$ such that $y$, but not necessarily $x$, is a tree root. The effect of a command $link(x, y)$ is to combine the trees containing $..."
  • 11:2211:22, 15 February 2023 diff hist +1,821‎ N Lowest Common Ancestor with Linking Roots ‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestor with Linking Roots (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, The queries are given on-line. Interspersed with the queries are on-line commands of the form $link(x, y)$ where $x$ and $y$ are tree roots. The effect of a command $link(x, y)$ is to combine the trees containing..."
  • 11:2211:22, 15 February 2023 diff hist +4,329‎ N Lowest Common Ancestor with Static Trees ‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestor with Static Trees (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, the collection of trees is static but the queries are given on-line. That is, each query must be answered before the next one is known. == Related Problems == Generalizations: Lowest Common Ancestor Relate..."
  • 11:2211:22, 15 February 2023 diff hist +2,082‎ N Off-Line Lowest Common Ancestor ‎ Created page with "{{DISPLAYTITLE:Off-Line Lowest Common Ancestor (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" In this version of the problem, the collection of trees is static and the entire sequence of queries is specified in advance. == Related Problems == Generalizations: Lowest Common Ancestor Related: Lowest Common Ancestor with Static Trees, ..."
  • 11:2211:22, 15 February 2023 diff hist +36‎ N Nearest Common Ancestor ‎ Redirected page to Lowest Common Ancestor current Tag: New redirect
  • 11:2211:22, 15 February 2023 diff hist +1,141‎ N Lowest Common Ancestor ‎ Created page with "{{DISPLAYTITLE:Lowest Common Ancestor (Lowest Common Ancestor)}} == Description == Given a collection of rooted trees, answer queries of the form, "What is the nearest common ancestor of vertices $x$ and $y$?" == Related Problems == Subproblem: Off-Line Lowest Common Ancestor, Lowest Common Ancestor with Static Trees, Lowest Common Ancestor with Linking Roots, Lowest Common Ancestor with Linking, Lowest Common Ancestors with Linking and Cutting..."
  • 11:2211:22, 15 February 2023 diff hist +1,285‎ N Cyclic Nontrivial SCCs DFA Minimization ‎ Created page with "{{DISPLAYTITLE:Cyclic Nontrivial SCCs DFA Minimization (DFA Minimization)}} == Description == Given an finite deterministic automaton (DFA) from a class $C$ of DFAs, whose nontrivial SCCs are cyclic, determine its minimal automaton given by the equivalence relation on states. == Related Problems == Generalizations: DFA Minimization Related: Acyclic DFA Minimization == Parameters == <pre>$n$: number of states $d$: number of transitions $k$: size of alphab..."
  • 11:2211:22, 15 February 2023 diff hist +1,268‎ N Acyclic DFA Minimization ‎ Created page with "{{DISPLAYTITLE:Acyclic DFA Minimization (DFA Minimization)}} == Description == Given an acyclic finite deterministic automaton (DFA) from a class $C$ of DFAs, determine its minimal automaton given by the equivalence relation on states. == Related Problems == Generalizations: DFA Minimization Related: Cyclic Nontrivial SCCs DFA Minimization == Parameters == <pre>$n$: number of states $d$: number of transitions $k$: size of alphabet</pre> == Table of Algo..."
  • 11:2211:22, 15 February 2023 diff hist +1,258‎ DFA Minimization ‎No edit summary
  • 11:2211:22, 15 February 2023 diff hist +221‎ Topological Sorting ‎No edit summary
  • 11:2211:22, 15 February 2023 diff hist +1,730‎ N Variance Calculations ‎ Created page with "{{DISPLAYTITLE:Variance Calculations (Variance Calculations)}} == Description == Given a set of n (real/integer) numbers, compute the variance (sample or population). Of interest is streaming algorithms and numerical stability. == Parameters == <pre>n: number of values</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Naïve..."
  • 11:2211:22, 15 February 2023 diff hist +1,415‎ N Voronoi Diagrams ‎ Created page with "{{DISPLAYTITLE:Voronoi Diagrams (Voronoi Diagrams)}} == Description == Given a set of n points in 2-dimensional space, compute the Voronoi diagram with the n points as seeds. == Parameters == <pre>n: number of points</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams)|For..."
  • 11:2211:22, 15 February 2023 diff hist +2,942‎ N Global Register Allocation ‎ Created page with "{{DISPLAYTITLE:Global Register Allocation (Register Allocation)}} == Description == Register allocation is the process of mapping the unlimited number of symbolic registers assumed in the intermediate language into the limited real machine registers. Global register allocation deals with the allocation of registers in code containing branches (http://www.cs.ucr.edu/~gupta/research/Publications/Comp/p370-gupta.pdf). == Related Problems == Related: Local Register A..."
  • 11:2211:22, 15 February 2023 diff hist +1,022‎ N Local Register Allocation ‎ Created page with "{{DISPLAYTITLE:Local Register Allocation (Register Allocation)}} == Description == Register allocation is the process of mapping the unlimited number of symbolic registers assumed in the intermediate language into the limited real machine registers. Local register allocation deals with the allocation of registers in straight-line code segments (http://www.cs.ucr.edu/~gupta/research/Publications/Comp/p370-gupta.pdf). == Related Problems == Related: Global Register..."
  • 11:2211:22, 15 February 2023 diff hist +1,930‎ N Cardinality Estimation ‎ Created page with "{{DISPLAYTITLE:Cardinality Estimation (Cardinality Estimation)}} == Description == Given a multiset of (possibly hashed) values, estimate the number of distinct elements of the multiset. Of interest is minimizing storage usage. == Parameters == <pre>N: number of values in multiset n: cardinality of multiset (not known)</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approxi..."
  • 11:2111:21, 15 February 2023 diff hist +2,106‎ N Maximum Likelihood Parameters ‎ Created page with "{{DISPLAYTITLE:Maximum Likelihood Parameters (Maximum Likelihood Parameters)}} == Description == In these algorithms, the goal is to estimate hyperparameters using maximum likelihood. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Expectation–maximization (EM) algorithm ( Maximum Likeliho..."
  • 11:2111:21, 15 February 2023 diff hist −82‎ Coset Enumeration ‎No edit summary
  • 11:2111:21, 15 February 2023 diff hist +52‎ N K-ANNS ‎ Redirected page to K Approximate Nearest Neighbors Search current Tag: New redirect
  • 11:2111:21, 15 February 2023 diff hist +456‎ N K Approximate Nearest Neighbors Search ‎ Created page with "{{DISPLAYTITLE:k Approximate Nearest Neighbors Search (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points, find approximately the $k$ closest points to a specified point. == Related Problems == Generalizations: k Nearest Neighbors Search == Parameters == <pre>n: number of points in dataset k: number of neighbors to find</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem."
  • 11:2111:21, 15 February 2023 diff hist +40‎ N K-NNS ‎ Redirected page to K Nearest Neighbors Search current Tag: New redirect
  • 11:2111:21, 15 February 2023 diff hist +437‎ N K Nearest Neighbors Search ‎ Created page with "{{DISPLAYTITLE:k Nearest Neighbors Search (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points, find the $k$ closest points to a specified point. == Related Problems == Subproblem: k Approximate Nearest Neighbors Search == Parameters == <pre>n: number of points in dataset k: number of neighbors to find</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem."
  • 11:2111:21, 15 February 2023 diff hist +265‎ N Root Computation ‎ Created page with "{{DISPLAYTITLE:Root Computation (Root Computation)}} == Description == Given a real continuous function, compute one of the roots. == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our database for the given problem."
  • 11:2111:21, 15 February 2023 diff hist +899‎ N Eigenpair closest to mu ‎ Created page with "{{DISPLAYTITLE:Eigenpair closest to mu (Eigenvalues (Iterative Methods))}} == Description == Given an $n \times n$ matrix $A$, find the eigenpair (eigenvalue and associated eigenvector) of $A$ with the eigenvalue closest to $\mu$. == Related Problems == Generalizations: Any Eigenpair Related: All Eigenvalues, Any Eigenvalue, All Eigenpairs, Eigenpair with the Largest Eigenvalue == Parameters == No parameters found. == Table of Algorithms ==..."
  • 11:2111:21, 15 February 2023 diff hist +1,382‎ N Eigenpair with the Largest Eigenvalue ‎ Created page with "{{DISPLAYTITLE:Eigenpair with the Largest Eigenvalue (Eigenvalues (Iterative Methods))}} == Description == Given an $n \times n$ matrix $A$, find the eigenpair (eigenvalue and associated eigenvector) of $A$ with the largest eigenvalue. == Related Problems == Generalizations: Any Eigenpair Related: All Eigenvalues, Any Eigenvalue, All Eigenpairs, Eigenpair closest to mu == Parameters == No parameters found. == Table of Algorithms == {| clas..."
  • 11:2111:21, 15 February 2023 diff hist +592‎ N Any Eigenpair ‎ Created page with "{{DISPLAYTITLE:Any Eigenpair (Eigenvalues (Iterative Methods))}} == Description == Given an $n \times n$ matrix $A$, find any eigenpair (eigenvalue and associated eigenvector) of $A$. == Related Problems == Subproblem: Any Eigenvalue, All Eigenpairs, Eigenpair with the Largest Eigenvalue, Eigenpair closest to mu Related: All Eigenvalues, All Eigenpairs, Eigenpair with the Largest Eigenvalue, Eigenpair closest to mu == Parameters..."

(newest | oldest) View ( | ) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:Contributions/Admin"