List of redirects
Jump to navigation
Jump to search
Showing below up to 174 results in range #1 to #174.
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)
- $(\min, +)$ Matrix Multiplication → Distance Product
- $(\min, +)$ Matrix Product → Distance Product
- $(\min, \leq)$ Matrix Multiplication → $(\min, \leq)$ Product
- 2-OV → OV
- 2-SAT → 2SAT
- 3-SAT → 3SAT
- 3-SAT-5 → 3SAT-5
- 3DVC → The Vertex Cover Problem, Degrees Bounded By 3
- 4-SAT → 4SAT
- 4/3-Diameter → Diameter 2 vs 3
- APMW → All Pairs Minimum Witness
- All-Pairs Shortest Paths → APSP
- And-or Matrix Product → Boolean Matrix Multiplication
- BC → Betweenness Centrality
- BHCP → Bichromatic Hamming Close Pair
- BMM → Boolean Matrix Multiplication
- BMM (Combinatorial) → Boolean Matrix Multiplication (Combinatorial)
- Boolean Satisfiability → SAT
- Boyce-Codd Normal Form Decomposition → BCNF Decomposition
- CNF-SAT → Conjunctive Normal Form SAT
- CPSP → Cyclic Peptide Sequencing Problem
- Conjunctive Büchi Objectives → Generalized Büchi Games
- ConnSub → Connected Subgraph
- Cycle Finding → Cycle Detection
- DNF-SAT → Disjunctive Normal Form SAT
- DTW → Dynamic Time Warping
- De-Duplication → Duplicate Elimination
- Decisional Boyce-Codd Normal Form → Decisional BCNF
- Domain:Signal Processing → Discrete Fourier Transform
- ER → Entity Resolution
- Family:All Maximal Non-Branching Paths in a Graph → All Maximal Non-Branching Paths in a Graph
- Family:All Permutations → All Permutations
- Family:Bichromatic Hamming Close Pair → Bichromatic Hamming Close Pair
- Family:Block Ciphers → Block Ciphers
- Family:Cardinality Estimation → Cardinality Estimation
- Family:Change-Making Problem → Change-Making Problem
- Family:Clock Synchronization in Distributed Systems → Clock Synchronization in Distributed Systems
- Family:Collaborative Filtering → Matrix Factorization
- Family:Constructing Eulerian Trails in a Graph → Constructing Eulerian Trails in a Graph
- Family:Constructing Suffix Trees → Constructing Suffix Trees
- Family:Convex Optimization (Non-linear) → Convex Optimization (Non-linear)
- Family:Coset Enumeration → Coset Enumeration
- Family:Cryptanalysis of Linear Feedback Shift Registers → Cryptanalysis of Linear Feedback Shift Registers
- Family:Culling → Culling
- Family:Cycle Detection → Cycle Detection
- Family:Cyclic Peptide Sequencing Problem → Cyclic Peptide Sequencing Problem
- Family:De Novo Genome Assembly → De Novo Genome Assembly
- Family:Delaunay Triangulation → Delaunay Triangulation
- Family:Determinant of Matrices with Integer Entries → Determinant of Matrices with Integer Entries
- Family:Discrete Fourier Transform → Discrete Fourier Transform
- Family:Disk Scheduling → Disk Scheduling
- Family:Distributed Locking Algorithms → Distributed Locking Algorithms
- Family:Duplicate Elimination → Duplicate Elimination
- Family:Dynamic Time Warping → Dynamic Time Warping
- Family:Entity Resolution → Entity Resolution
- Family:Factorization of Polynomials Over Finite Fields → Factorization of Polynomials Over Finite Fields
- Family:Filtering Problem (Stochastic Processes) → Filtering Problem (Stochastic Processes)
- Family:Finding Frequent Itemsets → Finding Frequent Itemsets
- Family:Frechet Distance → Frechet Distance
- Family:Frequent Words with Mismatches Problem → Frequent Words with Mismatches Problem
- Family:Geometric Base → Geometric Base
- Family:Greatest Common Divisor → Greatest Common Divisor
- Family:Gröbner Bases → Gröbner Bases
- Family:Hyperbolic Spline Interpolation → Hyperbolic Spline Interpolation
- Family:Image Compositing → Image Compositing
- Family:Image Segmentation → Image Segmentation
- Family:Independent Set Queries → Independent Set Queries
- Family:Informed Search → Informed Search
- Family:Joins → Joins
- Family:Key Exchange → Key Exchange
- Family:Line Drawing → Line Drawing
- Family:Line Simplification → Line Simplification
- Family:Logarithm Calculations → Discrete Logarithm Over Finite Fields
- Family:Longest Palindromic Substring → Longest Palindromic Substring
- Family:Longest Path Problem → Longest Path on Interval Graphs
- Family:Maximum Cut → Maximum Cut
- Family:Maximum Inner Product Search → Maximum Inner Product Search
- Family:Maximum Likelihood Methods in Unknown Latent Variables → Maximum Likelihood Methods in Unknown Latent Variables
- Family:Maximum Likelihood Parameters → Maximum Likelihood Parameters
- Family:Mesh Parameterization → Mesh Parameterization
- Family:Mesh Simplification → Mesh Simplification
- Family:Metricity → Metricity
- Family:Minimum value in each row of an implicitly-defined totally monotone matrix → Minimum value in each row of an implicitly-defined totally monotone matrix
- Family:Motif Search → Motif Search
- Family:Multiplication → Multiplication
- Family:Mutual Exclusion → Mutual Exclusion
- Family:NFA to DFA conversion → NFA to DFA conversion
- Family:Occupancy Grid Mapping → Occupancy Grid Mapping
- Family:Optimal Policies for MDPs → Optimal Policies for MDPs
- Family:POMDPs → POMDPs
- Family:Partial Match → Partial Match
- Family:Point-in-Polygon → Point-in-Polygon
- Family:Polynomial Interpolation → Polynomial Interpolation
- Family:Price Query → Price Query
- Family:RNA Folding → RNA Folding
- Family:Rasterization → Rasterization
- Family:Ray Tracing → Ray Tracing
- Family:Rod-Cutting Problem → Rod-Cutting Problem
- Family:SLAM Algorithms → SLAM Algorithms
- Family:Secret Sharing → Secret Sharing
- Family:Self-Balancing Trees Creation → Self-Balancing Trees Creation
- Family:Self-Balancing Trees Deletion → Self-Balancing Trees Deletion
- Family:Self-Balancing Trees Insertion → Self-Balancing Trees Insertion
- Family:Self-Balancing Trees Search → Self-Balancing Trees Search
- Family:Sequence-to-Graph Alignment → Sequence-To-Graph Alignment
- Family:Shown Surface Determination → (3-Dimensional, i.e. project onto a 2D plane)
- Family:Solutions to Nonlinear Equations → Solutions to Nonlinear Equations
- Family:Support Vector Machines (SVM) → Approximate Hard-Margin SVM
- Family:Texture Synthesis → Texture Synthesis
- Family:The Frequent Words Problem → The Frequent Words Problem
- Family:The Subset-Sum Problem → Subset Sum
- Family:Topological Sorting → Topological Sorting
- Family:Tower of Hanoi → Tower of Hanoi
- Family:Transitive Reduction Problem → Transitive Reduction Problem of Directed Graphs
- Family:Turnpike Problem → Turnpike Problem
- Family:Variance Calculations → Variance Calculations
- Family:Voronoi Diagrams → Voronoi Diagrams
- Family:d-Neighborhood of a String → D-Neighborhood of a String
- Family:kth Order Statistic → Kth Order Statistic
- Finding Association Rules → Finding Frequent Itemsets
- First Category Integer Factoring → Integer Factoring
- Fourth Normal Form Decomposition → 4NF Decomposition
- Funny Matrix Multiplication → Distance Product
- GCD → Greatest Common Divisor
- GED Computation → Exact GED
- Generalized Reachability in MDPs → Conjunctive Reachability Queries in MDPs
- GeomBase → Geometric Base
- Hash Functions → Databases
- Huffman Tree Problem → Huffman Encoding
- ILP → Integer Linear Programming
- Illumination Mapping → Environment Mapping
- Instance Identification → Duplicate Elimination
- K-ANNS → K Approximate Nearest Neighbors Search
- K-NNS → K Nearest Neighbors Search
- LCS → Longest Common Subsequence
- LCST → Largest Common Subtree
- Loop Detection → Cycle Detection
- MAX-CNF-SAT → MaxSAT
- MCF → Minimum-Cost Flow
- MCOP → Matrix Chain Ordering Problem
- MCSP → Matrix Chain Scheduling Problem
- MIPS → Maximum Inner Product Search
- Main Page/index.php → Main Page
- MaxSCC → Maximum Strongly Connected Component
- Max Cut → Maximum Cut
- Maximum Subsequence → 1D Maximum Subarray
- Minimum Weight Cycle → Shortest Cycle
- Minimum Weight k-Cycle → Shortest k-Cycle
- Nearest Common Ancestor → Lowest Common Ancestor
- OBST → Optimal Binary Search Tree Problem
- OGM → Occupancy Grid Mapping
- OMv → Online Matrix-Vector Multiplication
- Object Identification → Duplicate Elimination
- OuMv → Online Vector-Matrix-Vector Multiplication
- Partially Observable Markov Decision Process → POMDPs
- Pattern Matching on Hypertext → Sequence-To-Graph Alignment
- RPP → Replacement Paths Problem
- Record Linkage → Duplicate Elimination
- Record Matching → Duplicate Elimination
- Reflection Mapping → Environment Mapping
- SC2 → 2 Strong Components (dynamic)
- SCCs → Strongly Connected Components
- SRP → Stable Roommates Problem
- Second Category Integer Factoring → Smallest Factor
- Stable Matching Problem, SMP → Stable Marriage Problem
- Symmetric Diagonally Dominant System Solvers → Exact Laplacian Solver
- TC* → Triangle Collection*
- TSP → Minimum TSP
- The Frequent $k$-mers Problem → The Frequent Words Problem
- Three-dimensional elliptic partial differential equations → 3-Dimensional Poisson Problem
- Two-dimensional elliptic partial differential equations → 2-Dimensional Poisson Problem
- UOV → Unbalanced OV
- VC → The Vertex Cover Problem
- Weighted Activity Selection Problem → Weighted Interval Schedule Maximization Problem (ISMP)