List of redirects
Jump to navigation
Jump to search
Showing below up to 74 results in range #101 to #174.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- 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)