New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:25, 15 February 2023 Clock Synchronization in Distributed Systems (hist | edit) [1,552 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Clock Synchronization in Distributed Systems (Clock Synchronization in Distributed Systems)}} == Description == The difference between the largest and the smallest clock values among all stations in a Mobile Ad Hoc Network (MANET) is called the maximum clock offset. The goal is to minimize the maximum clock offset. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%"...")
- 10:25, 15 February 2023 Mesh Simplification (hist | edit) [4,955 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Mesh Simplification (Mesh Simplification)}} == Description == Given a surface mesh, accurately simplify it so that you may render the mesh accurately with less computing power. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Coplanar facets merging - M.J. De Haemer and M.J. Zy...")
- 10:25, 15 February 2023 Image Segmentation (hist | edit) [3,924 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Image Segmentation (Image Segmentation)}} == Description == Image segmentation is the division of an image into different regions, each having certain properties. It is the first step of image analysis which aims at either a description of an image or a classification of the image if a class label is meaningful. An example of the former is the description of an office scene. An example of the latter is the classification of the image of a cancerous cell....")
- 10:25, 15 February 2023 Point-in-Polygon (hist | edit) [2,488 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Point-in-Polygon (Point-in-Polygon)}} == Description == With a given polygon $P$ and an arbitrary point $q$, determine whether point $q$ is enclosed by the edges of the polygon. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Ray casting algorithm Shimrat; M (Point-in-Polygon...")
- 10:25, 15 February 2023 Specular Reflection (hist | edit) [1,646 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Specular Reflection (Texture Mapping)}} == Description == Texture mapping means the mapping of a function onto a surface in 3D. The domain of the function can be one, two, or three dimensional, and it can be represented by either an array or a mathematical function. The source image (texture) is mapped onto a surface in 3D object space, which is then mapped to the destination image (screen) by the viewing projection. Texture space is labeled $(u, v)$, o...")
- 10:25, 15 February 2023 Diffuse Reflection (hist | edit) [2,186 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Diffuse Reflection (Texture Mapping)}} == Description == Texture mapping means the mapping of a function onto a surface in 3D. The domain of the function can be one, two, or three dimensional, and it can be represented by either an array or a mathematical function. The source image (texture) is mapped onto a surface in 3D object space, which is then mapped to the destination image (screen) by the viewing projection. Texture space is labeled $(u, v)$, ob...")
- 10:25, 15 February 2023 Cyclic Peptide Sequencing Problem (hist | edit) [1,000 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Cyclic Peptide Sequencing Problem (Cyclic Peptide Sequencing Problem)}} == Description == Given an experimental $MS^3$ spectrum $S$, find a cyclic peptide $P$ maximizing the number of shared masses between $S$ and the theoretical spectrum of $P$. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! R...")
- 10:25, 15 February 2023 Distributed Locking Algorithms (hist | edit) [1,654 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Distributed Locking Algorithms (Distributed Locking Algorithms)}} == Description == The purpose of a lock is to ensure that among several nodes that might try to do the same piece of work, only one actually does it (at least only one at a time). That work might be to write some data to a shared storage system, to perform some computation, to call some external API, or suchlike. At a high level, there are two reasons why you might want a lock in a distrib...")
- 10:25, 15 February 2023 Texture Synthesis (hist | edit) [2,195 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Texture Synthesis (Texture Synthesis)}} == Description == Given a texture sample, synthesize a new texture that, when perceived by a human observer, appears to be generated by the same underlying stochastic process. == Parameters == <pre>n: number of pixels</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | tre...")
- 10:25, 15 February 2023 Image Compositing (hist | edit) [538 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Image Compositing (Image Compositing)}} == Description == Image compositing is the act of creating a single image from multiple images. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Petro Vlahos Algorithm || 1985...")
- 10:25, 15 February 2023 InDegree Analysis (hist | edit) [1,166 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:InDegree Analysis (Link Analysis)}} == Description == A simple heuristic that can be viewed as the predecessor of all Link Analysis Ranking algorithms is to rank the pages according to their popularity (also referred to as visibility (Marchiori 1997)). The popularity of a page is measured by the number of pages that link to this page. We refer to this algorithm as the InDegree algorithm, since it ranks pages according to their in-degree in the graph $G$....")
- 10:25, 15 February 2023 All Maximal Non-Branching Paths in a Graph (hist | edit) [1,101 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:All Maximal Non-Branching Paths in a Graph (All Maximal Non-Branching Paths in a Graph)}} == Description == A node $v$ in a directed graph $G$ is called a 1-in-1-out node if its indegree and outdegree are both equal to 1, i.e., $in(v) = out(v) = 1$. We can rephrase the definition of a "maximal non-branching path" from the main text as a path whose internal nodes are 1-in-1-out nodes and whose initial and final nodes are not 1-in-1-out nodes. The proble...")
- 10:24, 15 February 2023 Weighted Set-Covering (hist | edit) [2,602 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Weighted Set-Covering (The Set-Covering Problem)}} == Description == The set-covering problem where each set $s\in S$ is assigned a weight and the goal is to find the minimum weight sub-collection of $S$ that covers the universe. == Related Problems == Subproblem: Unweighted Set-Covering == Parameters == <pre>n: number of elements in the universe m: number of sets in the collection d: size of the largest set in collection H(x): the xth Harmonic...")
- 10:24, 15 February 2023 Unweighted Set-Covering (hist | edit) [2,605 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Unweighted Set-Covering (The Set-Covering Problem)}} == Description == Given a universe $U$, i.e. a set of elements $\{1, 2, \ldots, n\}$, and a collection $S$ of $m$ sets whose union is the universe, identify the smallest sub-collection of $S$ whose union is the universe. == Related Problems == Generalizations: Weighted Set-Covering == Parameters == <pre>U: the universe of elements to be covered S: the collection of sets n: number of elements...")
- 10:24, 15 February 2023 Optimal Policies for MDPs (hist | edit) [1,352 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Optimal Policies for MDPs (Optimal Policies for MDPs)}} == Description == In an MDP, a policy is a choice of what action to choose at each state An Optimal Policy is a policy where you are always choosing the action that maximizes the “return”/”utility” of the current state. The problem here is to find such an optimal policy from a given MDP. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" styl...")
- 10:24, 15 February 2023 Filtering Problem (Stochastic Processes) (hist | edit) [3,213 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Filtering Problem (Stochastic Processes) (Filtering Problem (Stochastic Processes))}} == Description == The filtering problem is to obtain the best linear estimate $\hat{z}_t$ of $z_t$ based on the past observations ($y_s | s\leq t)$. Abstractly, the solution to the problem of filtering corresponds to explicitly computing $\hat{z}_t = P_t^y(z_t)$ where $P_t^y$ is the projection operator onto the Hilbert space $H_t^y$. == Parameters == No parameters...")
- 10:24, 15 February 2023 Culling (hist | edit) [943 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Culling (Culling)}} == Description == Culling is the process of rejecting primitives or objects in their entireity before rendering in the case that they would not be shown in the view, reducing unnecessary computations. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | view fru...")
- 10:24, 15 February 2023 Blob Detection (hist | edit) [2,861 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Blob Detection (Feature Detection)}} == Description == The regions or points which have noticeable difference with their surroundings is called blob. Blob detection is the problem of detecting such blobs in a given image. == Related Problems == Related: Corner Detection == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! App...")
- 10:24, 15 February 2023 Corner Detection (hist | edit) [4,189 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Corner Detection (Feature Detection)}} == Description == Conventionally, a corner is defined as the intersection point or the junction point between two or more straight line edges (i.e. edges which have discontinuities along a straight line). Corner detection is the problem of detecting such corners in a given image. == Related Problems == Related: Blob Detection == Parameters == No parameters found. == Table of Algorithms == {| class="wiki...")
- 10:24, 15 February 2023 Matrix Factorization (hist | edit) [1,316 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Matrix Factorization (Collaborative Filtering)}} == Description == Collaborative filtering is a technique used in recommendation systems. It analyzes relationships between users and interdependencies among products to identify new user-item associations. A method of collaborative filtering uses matrix factorization. In its basic form, matrix factorization characterizes both items and users by vectors of factors inferred from item rating patterns. == Pa...")
- 10:24, 15 February 2023 Maximum Likelihood Methods in Unknown Latent Variables (hist | edit) [3,607 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Likelihood Methods in Unknown Latent Variables (Maximum Likelihood Methods in Unknown Latent Variables)}} == Description == In this problem, the goal is to compute maximum-likelihood estimates when the observations can be viewed as incomplete data. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !!...")
- 10:24, 15 February 2023 Mesh Parameterization (hist | edit) [5,660 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Mesh Parameterization (Mesh Parameterization)}} == Description == Given any two surfaces with similar topology it is possible to compute a one-to-one and onto mapping between them. If one of these surfaces is represented by a triangular mesh, the problem of computing such a mapping is referred to as mesh parameterization. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width=...")
- 10:24, 15 February 2023 Hyperbolic Spline Interpolation (hist | edit) [2,566 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Hyperbolic Spline Interpolation (Hyperbolic Spline Interpolation)}} == Description == The problem of restoring complex curves and surfaces from discrete data so that their shape is preserved is called isogeometric interpolation. A very popular tool for solving this problem are hyperbolic splines in tension, which were introduced in 1966 by Schweikert. These splines have smoothness sufficient for many applications; combined with algorithms for the automat...")
- 10:24, 15 February 2023 DAG Realization Problem (hist | edit) [1,159 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:DAG Realization Problem (Graph Realization Problems)}} == Description == Given a sequence $S := (a_1, b_1), \ldots, (a_n, b_n)$ with $a_i, b_i \in \mathbb{Z}_0^+$, does there exist a directed acyclic graph (DAG) (no parallel arcs allowed) with labeled vertex set $V := \{v_1, \ldots , v_n\}$ such that for all $v_i \in V$ indegree and outdegree of $v_i$ match exactly the given numbers $a_i$ and $b_i$, respectively? == Related Problems == Generalizations...")
- 10:24, 15 February 2023 Digraph Realization Problem (hist | edit) [1,531 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Digraph Realization Problem (Graph Realization Problems)}} == Description == Given a sequence $S := (a_1, b_1), \ldots, (a_n, b_n)$ with $a_i, b_i \in \mathbb{Z}_0^+$, does there exist a directed graph (no parallel arcs allowed) with labeled vertex set $V := \{v_1, \ldots , v_n\}$ such that for all $v_i \in V$ indegree and outdegree of $v_i$ match exactly the given numbers $a_i$ and $b_i$, respectively? == Related Problems == Subproblem: DAG Realiza...")
- 10:24, 15 February 2023 Subtree Isomorphism (hist | edit) [1,788 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Subtree Isomorphism (Graph Isomorphism Problem)}} == Description == Determine whether a given tree is contained within another tree. == Related Problems == Generalizations: Largest Common Subtree Related: Graph Isomorphism, General Graphs, Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences == Parameters == <pre>n: number of vertices in the...")
- 10:24, 15 February 2023 Largest Common Subtree (hist | edit) [1,845 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Largest Common Subtree (Graph Isomorphism Problem)}} == Description == Find a largest tree which occurs as a common subgraph in a given collection of trees. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Subproblem: Subtree Isomorphism Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences == Parameters ==...")
- 10:24, 15 February 2023 Graph Isomorphism, Bounded Vertex Valences (hist | edit) [1,580 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Bounded Vertex Valences (Graph Isomorphism Problem)}} == Description == Given two graphs with the degree of each vertex bounded, determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Largest Common Subtree, Subtree Isomorphism == Par...")
- 10:24, 15 February 2023 Graph Isomorphism, Trivalent Graphs (hist | edit) [1,323 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Trivalent Graphs (Graph Isomorphism Problem)}} == Description == Given two trivalent graphs (AKA cubic graphs--graphs in which each vertex has degree 3), determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree,...")
- 10:24, 15 February 2023 Graph Isomorphism, Bounded Number of Vertices of Each Color (hist | edit) [1,706 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, Bounded Number of Vertices of Each Color (Graph Isomorphism Problem)}} == Description == Given two colored graphs with the number of vertices of each color bounded, determine whether they are isomorphic to one another. == Related Problems == Generalizations: Graph Isomorphism, General Graphs Related: Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree, Subtree Is...")
- 10:24, 15 February 2023 Graph Isomorphism, General Graphs (hist | edit) [1,715 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Graph Isomorphism, General Graphs (Graph Isomorphism Problem)}} == Description == Given two graphs, determine whether they are isomorphic to one another. == Related Problems == Subproblem: Graph Isomorphism, Bounded Number of Vertices of Each Color, Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Vertex Valences, Largest Common Subtree Related: Graph Isomorphism, Trivalent Graphs, Graph Isomorphism, Bounded Ve...")
- 10:24, 15 February 2023 Arithmetic Expression Binary Tree (hist | edit) [866 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Arithmetic Expression Binary Tree (AST to Code Translation)}} == Description == Translate a given arithmetic expression binary tree into machine-readable code that uses as few registers as possible. == Related Problems == Related: AST to Code Translation == Parameters == <pre>$n$: number of nodes in the tree</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space...")
- 10:23, 15 February 2023 AST to Code Translation (hist | edit) [498 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:AST to Code Translation (AST to Code Translation)}} == Description == Translate a given abstract syntax tree (AST) into machine-readable code that uses as few registers as possible. == Related Problems == Related: Arithmetic Expression Binary Tree == Parameters == <pre>$n$: number of nodes in the tree</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Time Complexity graph == File:AST to Co...")
- 10:23, 15 February 2023 Longest Palindromic Substring (hist | edit) [1,621 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Palindromic Substring (Longest Palindromic Substring)}} == Description == Given a string of length $n$, find the palindromic substrings of maximal length. == Parameters == <pre>n: length of given string</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Naive (Longest Palindromic Substring Longest Palin...")
- 10:23, 15 February 2023 Entity Resolution (hist | edit) [2,418 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Entity Resolution (Entity Resolution)}} == Description == Entity resolution (ER) is the problem of matching records that represent the same real-world entity and then merging the matching records. ER is a well known problem that arises in many applications. An exhaustive ER process involves comparing all the pairs of records, which can be very expensive for large datasets. == Parameters == No parameters found. == Table of Algorithms == {| class="wi...")
- 10:23, 15 February 2023 Ray Tracing (hist | edit) [1,257 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Ray Tracing (Ray Tracing)}} == Description == Ray tracing is an image rendering technique in which rays are cast from the viewpoint and followed as they reflect off of objects in the scene. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Dürer rendering algorithm ( Ray Tracin...")
- 10:23, 15 February 2023 Constructing Suffix Trees (hist | edit) [3,185 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Constructing Suffix Trees (Constructing Suffix Trees)}} == Description == Let $T = t_1 t_2 \cdots t_n, be a string over an alphabet $\Sigma$. Each string $x$ such that $T = uxv$ for some (possibly empty) strings $u$ and $v$ is a substring of $T$, and each string $T_i = t_i \cdots t_n$, where $1 \leq i \leq n + 1$ is a suffix of $T$; in particular, $T_{n+1} = \epsilon$ is the empty suffix. The set of all suffixes of $T$ is denoted $\sigma(T)$. The suffix...")
- 10:23, 15 February 2023 Maximum Square Subarray (hist | edit) [931 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Square Subarray (Maximum Subarray Problem)}} == Description == Given an $n \times n$ matrix find a maximum subarray with sides of equal length. == Related Problems == Generalizations: Maximum Subarray Related: 1D Maximum Subarray, 2D Maximum Subarray == Parameters == <pre>n: dimension of array</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reductions FROM Problem == {| cl...")
- 10:23, 15 February 2023 2D Maximum Subarray (hist | edit) [1,454 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:2D Maximum Subarray (Maximum Subarray Problem)}} == Description == Given an $n \times n$ matrix $A$ of integers, find $i, j, k,l \in (n)$ with $i \leq j, k \leq l$ maximizing $\sum^j_{x=i}\sum^l_{y=k}A(x,y)$, that is, find a contiguous subarray of $A$ of maximum sum == Related Problems == Generalizations: Maximum Subarray Related: 1D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: dimension of array</pre> == Table o...")
- 10:23, 15 February 2023 1D Maximum Subarray (hist | edit) [2,453 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:1D Maximum Subarray (Maximum Subarray Problem)}} == Description == Given an array $A$ of length $n$, find $i, j$ with $1\leq i \leq j \leq n$ maximizing $\sum^j_{x=i} A(x)$, that is, find a contiguous subarray of $A$ of maximum sum == Related Problems == Generalizations: Maximum Subarray Related: 2D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: length of array</pre> == Table of Algorithms == {| class="wikitable...")
- 10:23, 15 February 2023 Maximum Subarray (hist | edit) [3,820 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Maximum Subarray (Maximum Subarray Problem)}} == Description == Given a $d$-dimensional array $M$ with $n^d$ real-valued entries, find the $d$-dimensional subarray of $M$ which maximizes the sum of the elements it contains. == Related Problems == Subproblem: 1D Maximum Subarray, 2D Maximum Subarray, Maximum Square Subarray Related: 2D Maximum Subarray, Maximum Square Subarray == Parameters == <pre>n: length of array d: dimens...")
- 10:23, 15 February 2023 Longest Path on Interval Graphs (hist | edit) [1,175 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Longest Path on Interval Graphs (Longest Path Problem)}} == Description == The longest path problem is the problem of finding a path of maximum length in a graph. A graph $G$ is called interval graph if its vertices can be put in a one-to-one correspondence with a family $F$ of intervals on the real line such that two vertices are adjacent in $G$ if and only if the corresponding intervals intersect; $F$ is called an intersection model for $G$. == Param...")
- 10:23, 15 February 2023 Stable Pair Checking (hist | edit) [2,059 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Pair Checking (Stable Matching Problem)}} == Description == Verify that a given pairing is stable, given the preferences == Related Problems == Generalizations: Stable Marriage Problem Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Matching Verification == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our database...")
- 10:23, 15 February 2023 Stable Matching Verification (hist | edit) [1,096 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Matching Verification (Stable Matching Problem)}} == Description == Verify that a given matching is stable, given the preferences == Related Problems == Generalizations: Stable Marriage Problem Related: Almost Stable Marriage Problem, Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Pair Checking == Parameters == No parameters found. == Table of Algorithms == Currently no algorithms in our databas...")
- 10:23, 15 February 2023 Boolean d-Attribute Stable Matching (hist | edit) [1,582 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean d-Attribute Stable Matching (Stable Matching Problem)}} == Description == SMP in the d-attribute model. In the d-attribute model, we assume that there are d different attributes (e.g. income, height, sense of humor, etc.) with a fixed, possibly objective, ranking of the men for each attribute. Each woman’s preference list is based on a linear combination of the attributes of the men, where each woman can have different weights for each attribut...")
- 10:23, 15 February 2023 Stable Roommates Problem (hist | edit) [1,504 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Roommates Problem (Stable Matching Problem)}} == Description == Given $2n$ participants, each of participant ranks the others in strict order of preference. A matching is a set of $n$ disjoint pairs of participants. A matching $M$ in an instance of SRP is stable if there are no two participants $x$ and $y$, each of whom prefers the other to their partner in $M$. Such a pair is said to block $M$, or to be a blocking pair with respect to $M$. == Re...")
- 10:23, 15 February 2023 Almost Stable Marriage Problem (hist | edit) [971 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Almost Stable Marriage Problem (Stable Matching Problem)}} == Description == The task in the Almost Stable Marriage Problem is to find a matching that minimises the number of unstable edges, but the matching does not have to be a maximum matching. == Related Problems == Generalizations: Stable Marriage Problem Related: Stable Roommates Problem, Boolean d-Attribute Stable Matching, Stable Matching Verification, Stable Pair Checking...")
- 10:23, 15 February 2023 Stable Marriage Problem (hist | edit) [3,036 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Stable Marriage Problem (Stable Matching Problem)}} == Description == Given $n$ men and $n$ women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. When there are no such pairs of people, the set of marriages is deemed stable. == Related Problems == Generalizations: ...")
- 10:23, 15 February 2023 Factorization of Polynomials Over Finite Fields (hist | edit) [864 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Factorization of Polynomials Over Finite Fields (Factorization of Polynomials Over Finite Fields)}} == Description == Factor a given polynomial over a finite field into a product of irreducible polynomials. == Parameters == No parameters found. == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Schubert's algorithm (...")
- 10:23, 15 February 2023 Lossless Compression (hist | edit) [591 bytes] Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Lossless Compression (Data Compression)}} == Description == The reduction or ideally elimination of redundancies in the original data to result in smaller required storage space is the goal of every compression scheme. There are two categories of data compression: lossy and lossless. Lossless compression is fully information-preserving and fully reversible. == Related Problems == Related: Lossy Compression == Parameters == No parameters found....")