Oldest pages
Jump to navigation
Jump to search
Showing below up to 500 results in range #51 to #550.
View (previous 500 | next 500) (20 | 50 | 100 | 250 | 500)
- Ford Fulkerson Algorithm (11:56, 10 October 2022)
- Fortune-Hopcroft Algorithm (11:56, 10 October 2022)
- Gaussian Elimination (11:56, 10 October 2022)
- Generating random permutations (11:56, 10 October 2022)
- Godbole's DP Algorithm (11:56, 10 October 2022)
- Graph edit distance computation (11:56, 10 October 2022)
- Gröbner bases (11:56, 10 October 2022)
- Held–Karp Algorithm (11:56, 10 October 2022)
- Hierholzer's Algorithm (11:56, 10 October 2022)
- Historical Origins (11:56, 10 October 2022)
- Hoare's Selection Algorithm (11:57, 10 October 2022)
- Hopcroft's DFA Algorithm (11:57, 10 October 2022)
- Hopcroft–Karp algorithm (11:57, 10 October 2022)
- Hungarian Algorithm (11:57, 10 October 2022)
- INDEGREE analysis (11:57, 10 October 2022)
- Image Processing (11:57, 10 October 2022)
- Improvement Rankings (11:57, 10 October 2022)
- Integer relation (11:57, 10 October 2022)
- Jarvis Scan (11:57, 10 October 2022)
- K-d Tree (11:57, 10 October 2022)
- Kahn's Algorithm (11:57, 10 October 2022)
- Karatsuba Algorithm (11:57, 10 October 2022)
- Key exchange (11:57, 10 October 2022)
- Khachiyan Ellipsoid Algorithm (11:57, 10 October 2022)
- Knuth's DP Algorithm (11:57, 10 October 2022)
- Knuth-Morris-Pratt Algorithm (11:57, 10 October 2022)
- Kruskal's Algorithm (11:57, 10 October 2022)
- Kth order statistic (11:57, 10 October 2022)
- LU decomposition (11:57, 10 October 2022)
- Lawler's Graph Coloring Algorithm (11:58, 10 October 2022)
- Lemke–Howson Algorithm (11:58, 10 October 2022)
- Lemke–Howson algorithm (11:58, 10 October 2022)
- Linde–Buzo–Gray Algorithm (11:58, 10 October 2022)
- Line Clipping (11:58, 10 October 2022)
- Line Intersections (11:58, 10 October 2022)
- Line drawing (11:58, 10 October 2022)
- Linear Equations (11:58, 10 October 2022)
- Link analysis (PAGERANK and variants) (11:58, 10 October 2022)
- LogLog Algorithm (11:58, 10 October 2022)
- Logarithm calculations (11:58, 10 October 2022)
- Longest common subsequence (11:58, 10 October 2022)
- Longest palindromic substring (11:58, 10 October 2022)
- Longest path on interval graphs (11:58, 10 October 2022)
- Lossy compression (11:58, 10 October 2022)
- Lowest common ancestor (11:58, 10 October 2022)
- MDPs for optimal policies (11:58, 10 October 2022)
- Matrix Factorization for Collaborative Filtering (11:58, 10 October 2022)
- Matrix chain multiplication (11:58, 10 October 2022)
- Maximum-weight matching (11:59, 10 October 2022)
- Maximum Flow (11:59, 10 October 2022)
- Maximum cardinality matching (11:59, 10 October 2022)
- Maximum cut (11:59, 10 October 2022)
- Maximum subarray problem (11:59, 10 October 2022)
- Min. Spanning Tree (11:59, 10 October 2022)
- Money Change (11:59, 10 October 2022)
- N-Queens Problem (11:59, 10 October 2022)
- Nash Equilibria (11:59, 10 October 2022)
- Nearest Neighbour (11:59, 10 October 2022)
- Needleman–Wunsch algorithm (11:59, 10 October 2022)
- Nested Loop Join (11:59, 10 October 2022)
- Non-priority optimal interval Scheduling (11:59, 10 October 2022)
- Numerical Analysis (11:59, 10 October 2022)
- Operating Systems (11:59, 10 October 2022)
- Page replacements (11:59, 10 October 2022)
- Parsing (11:59, 10 October 2022)
- Point in Polygon (11:59, 10 October 2022)
- Polygon clipping (12:00, 10 October 2022)
- Polynomial interpolation (12:00, 10 October 2022)
- Quadratic Sieve (12:00, 10 October 2022)
- Rabin–Scott Powerset Construction (12:00, 10 October 2022)
- Radix Sort (12:00, 10 October 2022)
- Ramer–Douglas–Peucker Algorithm (12:00, 10 October 2022)
- Recovery (12:00, 10 October 2022)
- Register Allocation (12:00, 10 October 2022)
- Representative Algorithms (12:00, 10 October 2022)
- Robotics (12:00, 10 October 2022)
- Rod-cutting problem (12:00, 10 October 2022)
- SDD Systems Solvers (12:00, 10 October 2022)
- SMAWK Algorithm (12:00, 10 October 2022)
- Second category integer factoring (12:00, 10 October 2022)
- Secret-sharing algorithms (12:00, 10 October 2022)
- Self-balancing trees creation (12:00, 10 October 2022)
- Self-balancing trees deletion (12:00, 10 October 2022)
- Self-balancing trees insertion (12:00, 10 October 2022)
- Self-balancing trees search (12:00, 10 October 2022)
- Sequence Alignment (12:00, 10 October 2022)
- Sequence to Graph Alignment (12:00, 10 October 2022)
- Shortest Path(Directed graphs) (12:00, 10 October 2022)
- Sorting - Comparison (12:01, 10 October 2022)
- Sorting - Non-Comparison (12:01, 10 October 2022)
- Stable Marriage Problem/Stable Roommates Problem (12:01, 10 October 2022)
- Statistics (12:01, 10 October 2022)
- Strassen's Algorithm (12:01, 10 October 2022)
- String Search (12:01, 10 October 2022)
- Tarjan's LCA Algorithm (12:01, 10 October 2022)
- Tarjan's SSC Algorithm (12:01, 10 October 2022)
- Template Page (12:01, 10 October 2022)
- The frequent words problem (12:01, 10 October 2022)
- The set-covering problem (12:01, 10 October 2022)
- The subset-sum problem (12:01, 10 October 2022)
- The traveling-salesman problem (12:01, 10 October 2022)
- The vertex-cover problem (12:01, 10 October 2022)
- Todd–Coxeter algorithm (12:01, 10 October 2022)
- Transitive Reduction problem (12:01, 10 October 2022)
- Translating abstract syntax trees (12:01, 10 October 2022)
- Turnpike problem (12:01, 10 October 2022)
- Two-pass Algorithm (12:01, 10 October 2022)
- Vaidya's Algorithm (12:02, 10 October 2022)
- Vatti Clipping Algorithm (12:02, 10 October 2022)
- Vornoi Diagrams (12:02, 10 October 2022)
- Wagner-Fischer Algorithm (12:02, 10 October 2022)
- Weighted Activity selection problem (12:02, 10 October 2022)
- Wheel Factorization (12:02, 10 October 2022)
- List:Problem Families (11:11, 15 February 2023)
- List:Hypotheses (11:11, 15 February 2023)
- List:Domains (11:11, 15 February 2023)
- Domain:Bioinformatics (11:11, 15 February 2023)
- Domain:Databases (11:11, 15 February 2023)
- Domain:Image Processing (11:11, 15 February 2023)
- Domain:Robotics (11:11, 15 February 2023)
- Domain:Statistics (11:11, 15 February 2023)
- Domain:Cryptography (11:11, 15 February 2023)
- Family:Sorting (11:11, 15 February 2023)
- Family:Matrix Chain Multiplication (11:12, 15 February 2023)
- Family:Longest Common Subsequence (11:12, 15 February 2023)
- Family:Maximum Flow (11:12, 15 February 2023)
- Family:Matrix Product (11:12, 15 February 2023)
- Family:Linear System (11:12, 15 February 2023)
- Family:Linear Programming (11:12, 15 February 2023)
- Family:Line segment intersection (11:12, 15 February 2023)
- Family:Convex Hull (11:12, 15 February 2023)
- Family:Strongly Connected Components (11:12, 15 February 2023)
- Family:Minimum Spanning Tree (MST) (11:12, 15 February 2023)
- Family:Closest Pair Problem (11:13, 15 February 2023)
- Family:Shortest Path (Directed Graphs) (11:13, 15 February 2023)
- Family:All-Pairs Shortest Paths (APSP) (11:13, 15 February 2023)
- Family:Integer Factoring (11:13, 15 February 2023)
- Family:LU Decomposition (11:13, 15 February 2023)
- Family:String Search (11:14, 15 February 2023)
- Family:Sequence Alignment (11:14, 15 February 2023)
- Family:Line Clipping (11:14, 15 February 2023)
- Family:Maximum Cardinality Matching (11:14, 15 February 2023)
- Family:SDD Systems Solvers (11:14, 15 February 2023)
- Family:Generating Random Permutations (11:14, 15 February 2023)
- Family:Optimal Binary Search Trees (11:14, 15 February 2023)
- Family:Nash Equilibria (11:14, 15 February 2023)
- Family:Maximum-Weight Matching (11:14, 15 February 2023)
- Family:Polygon Clipping (11:14, 15 February 2023)
- Family:Eigenvalues (Iterative Methods) (11:14, 15 February 2023)
- Family:Register Allocation (11:14, 15 February 2023)
- Family:DFA Minimization (11:14, 15 February 2023)
- Family:Lowest Common Ancestor (11:14, 15 February 2023)
- Family:Graph Edit Distance Computation (11:14, 15 February 2023)
- Family:Clique Problems (11:14, 15 February 2023)
- Family:The Traveling-Salesman Problem (11:14, 15 February 2023)
- Family:Poisson Problem (11:15, 15 February 2023)
- Family:Dependency Inference Problem (11:15, 15 February 2023)
- Family:BCNF Decomposition (11:15, 15 February 2023)
- Family:4NF Decomposition (11:15, 15 February 2023)
- Family:The Vertex Cover Problem (11:15, 15 February 2023)
- Family:CFG Problems (11:15, 15 February 2023)
- Family:Data Compression (11:15, 15 February 2023)
- Family:Stable Matching Problem (11:15, 15 February 2023)
- Family:Maximum Subarray Problem (11:15, 15 February 2023)
- Family:AST to Code Translation (11:15, 15 February 2023)
- Family:Graph Isomorphism Problem (11:15, 15 February 2023)
- Family:Graph Realization Problems (11:15, 15 February 2023)
- Family:Feature Detection (11:15, 15 February 2023)
- Family:The Set-Covering Problem (11:15, 15 February 2023)
- Family:Link Analysis (11:15, 15 February 2023)
- Family:Texture Mapping (11:16, 15 February 2023)
- Family:Wiener Index (11:16, 15 February 2023)
- Family:Integer Relation (11:16, 15 February 2023)
- Family:n-Queens Problem (11:16, 15 February 2023)
- Family:Median String Problem (11:16, 15 February 2023)
- Family:Integral Equations (11:16, 15 February 2023)
- Family:One-Way Hash Functions (11:16, 15 February 2023)
- Family:Deadlock Avoidance (11:16, 15 February 2023)
- Family:Page Replacements (11:16, 15 February 2023)
- Family:Graph Coloring (11:17, 15 February 2023)
- Family:Boolean Satisfiability (11:17, 15 February 2023)
- Family:Orthogonal Vectors (11:17, 15 February 2023)
- Family:Graph Metrics (11:17, 15 February 2023)
- Family:Vertex Centrality (11:17, 15 February 2023)
- Family:Graph Triangle Problems (11:17, 15 February 2023)
- Family:Geometric Incidence Problems (11:17, 15 February 2023)
- Family:Geometric Separator Problems (11:17, 15 February 2023)
- Family:Geometric Covering Problems (11:17, 15 February 2023)
- Family:Geometric Visibility Problems (11:17, 15 February 2023)
- Family:Motion Planning Problems (11:17, 15 February 2023)
- Family:Local Alignment (11:17, 15 February 2023)
- Family:Minimum Witness (11:17, 15 February 2023)
- Family:Graph Cycles (11:17, 15 February 2023)
- Family:Matrix-Vector Multiplication (11:17, 15 February 2023)
- Family:Vertex Reachability (11:17, 15 February 2023)
- Family:Model-Checking Problem (11:17, 15 February 2023)
- Family:Dihedral Rotation Queries (11:17, 15 February 2023)
- Family:3SUM (11:17, 15 February 2023)
- Ray Tracing (11:23, 15 February 2023)
- Culling (11:24, 15 February 2023)
- Image Compositing (11:25, 15 February 2023)
- Diffuse Reflection (11:25, 15 February 2023)
- Mesh Simplification (11:25, 15 February 2023)
- POMDPs (11:25, 15 February 2023)
- Rasterization (11:25, 15 February 2023)
- Environment Mapping (11:25, 15 February 2023)
- Occupancy Grid Mapping (11:25, 15 February 2023)
- Fredholm Equations (11:26, 15 February 2023)
- Volterra Equations (11:26, 15 February 2023)
- Steal/No-Force (11:26, 15 February 2023)
- No-Steal/Force (11:26, 15 February 2023)
- Chromatic Polynomial (11:27, 15 February 2023)
- Maximum Inner Product Search (11:30, 15 February 2023)
- Approximate Hard-Margin SVM (11:30, 15 February 2023)
- Exponential Time Hypothesis (ETH) (11:30, 15 February 2023)
- Strong Exponential Time Hypothesis (SETH) (11:30, 15 February 2023)
- Orthogonal Vectors Hypothesis (OVH) (11:30, 15 February 2023)
- Unbalanced Orthogonal Vectors Hypothesis (UOVH) (11:30, 15 February 2023)
- K-OV Hypothesis (11:30, 15 February 2023)
- K-Clique Hypothesis (11:30, 15 February 2023)
- 3SUM Hypothesis (3-SUM Hypothesis) (11:30, 15 February 2023)
- All Pairs Shortest Paths Hypothesis (APSP Hypothesis) (11:30, 15 February 2023)
- Hitting Set Hypothesis (HS Hypothesis) (11:30, 15 February 2023)
- Min-Weight k-Clique Hypothesis (11:30, 15 February 2023)
- Exact k-Clique Hypothesis (11:30, 15 February 2023)
- Boolean Matrix Multiplication Hypothesis (BMM Hypothesis) (11:30, 15 February 2023)
- Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (11:30, 15 February 2023)
- Nondeterministic Strong Exponential Time Hypothesis (NSETH) (11:30, 15 February 2023)
- More Believable Exponential Time Hypothesis (MBETH) (11:30, 15 February 2023)
- Strong Triangle Conjecture (11:30, 15 February 2023)
- $\delta$-Triangle Conjecture (11:31, 15 February 2023)
- Parametrized Inapproximability Hypothesis (PIH) (11:31, 15 February 2023)
- Weak Parametrized Inapproximability Hypothesis (WPIH) (11:31, 15 February 2023)
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Karpinski (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (11:31, 15 February 2023)
- Larmore (Approximate OBST Optimal Binary Search Trees) (11:31, 15 February 2023)
- Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (11:31, 15 February 2023)
- Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (11:31, 15 February 2023)
- Pisinger (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Faaland (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Pferschy (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Klinz (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Epstein (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Lokshtanov (Subset Sum The Subset-Sum Problem) (11:31, 15 February 2023)
- Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem) (11:31, 15 February 2023)
- Lawrence, Reilly (Motif Search Motif Search) (11:31, 15 February 2023)
- Lawrence Gibbs Sampling (Motif Search Motif Search) (11:31, 15 February 2023)
- MotifSampler (Motif Search Motif Search) (11:31, 15 February 2023)
- Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis) (11:31, 15 February 2023)
- Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) (11:31, 15 February 2023)
- Grigoryan (n-Queens Completion n-Queens Problem) (11:31, 15 February 2023)
- Sedgewick; Szymanski; and Yao ( Cycle Detection) (11:31, 15 February 2023)
- Nivasch ( Cycle Detection) (11:31, 15 February 2023)
- Counting Sort (Non-Comparison Sorting Sorting) (11:31, 15 February 2023)
- Bucket Sort (Non-Comparison Sorting Sorting) (11:31, 15 February 2023)
- Radix Sort (Non-Comparison Sorting Sorting) (11:31, 15 February 2023)
- Ford & Fulkerson ( Maximum Flow) (11:32, 15 February 2023)
- Dinitz ( Maximum Flow) (11:32, 15 February 2023)
- Karzanov ( Maximum Flow) (11:32, 15 February 2023)
- Naive algorithm (Matrix Multiplication Matrix Product) (11:32, 15 February 2023)
- Pan's algorithm (Matrix Multiplication Matrix Product) (11:32, 15 February 2023)
- Romani's algorithm (Matrix Multiplication Matrix Product) (11:32, 15 February 2023)
- Vassilevska Williams (Matrix Multiplication Matrix Product) (11:32, 15 February 2023)
- François Le Gall (Matrix Multiplication Matrix Product) (11:32, 15 February 2023)
- Brute force (4-Graph Coloring Graph Coloring) (11:32, 15 February 2023)
- Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System) (11:32, 15 February 2023)
- Cholesky (Positive Definite, Hermitian Matrix Linear System) (11:32, 15 February 2023)
- Aasen's method (Non-Definite, Symmetric Matrix Linear System) (11:32, 15 February 2023)
- Levinson–Durbin recursion (Toeplitz Matrix Linear System) (11:32, 15 February 2023)
- Bareiss Algorithm (Toeplitz Matrix Linear System) (11:32, 15 February 2023)
- Bjorck-Pereyra (Vandermonde Matrix Linear System) (11:32, 15 February 2023)
- Brute Force (2-dimensional Convex Hull) (11:32, 15 February 2023)
- Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) (11:32, 15 February 2023)
- Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition) (11:32, 15 February 2023)
- Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) (11:32, 15 February 2023)
- A* Algorithm (Informed Search Informed Search) (11:32, 15 February 2023)
- Bidirectional A* Algorithm (Informed Search Informed Search) (11:32, 15 February 2023)
- Fringe Saving A* (FSA*) (Informed Search Informed Search) (11:32, 15 February 2023)
- Generalized Adaptive A* (GAA*) (Informed Search Informed Search) (11:32, 15 February 2023)
- Iterative Deepening A* (IDA*) (Informed Search Informed Search) (11:33, 15 February 2023)
- Jump Point Search (JPS) (Informed Search Informed Search) (11:33, 15 February 2023)
- Lifelong Planning A* (LPA*) (Informed Search Informed Search) (11:33, 15 February 2023)
- Simplified Memory-Bounded A* (SMA*) (Informed Search Informed Search) (11:33, 15 February 2023)
- Theta* (Informed Search Informed Search) (11:33, 15 February 2023)
- Anytime Repairing A* (ARA*) (Informed Search Informed Search) (11:33, 15 February 2023)
- Time-Bounded A* (TBA*) (Informed Search Informed Search) (11:33, 15 February 2023)
- Naïve string-search algorithm (Single String Search String Search) (11:33, 15 February 2023)
- Boyer-Moore (BM) algorithm (Single String Search String Search) (11:33, 15 February 2023)
- Rabin-Karp (RK) algorithm (Single String Search String Search) (11:33, 15 February 2023)
- Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment) (11:33, 15 February 2023)
- Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment) (11:33, 15 February 2023)
- Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment) (11:33, 15 February 2023)
- Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment) (11:33, 15 February 2023)
- FASTA (Edit sequence, local alignment Sequence Alignment) (11:33, 15 February 2023)
- Gotoh (Edit sequence, local alignment Sequence Alignment) (11:33, 15 February 2023)
- Altschul and Erickson (Edit sequence, local alignment Sequence Alignment) (11:33, 15 February 2023)
- Myers and Miller (Edit sequence, local alignment Sequence Alignment) (11:33, 15 February 2023)
- David Sankoff (Edit sequence, global alignment Sequence Alignment) (11:33, 15 February 2023)
- Rabin–Scott powerset construction ( NFA to DFA conversion) (11:33, 15 February 2023)
- Grenander (1D Maximum Subarray Maximum Subarray Problem) (11:34, 15 February 2023)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) (11:34, 15 February 2023)
- Speller (Motif Search Motif Search) (11:34, 15 February 2023)
- Mitra (Motif Search Motif Search) (11:34, 15 February 2023)
- Census (Motif Search Motif Search) (11:34, 15 February 2023)
- Risotto (Motif Search Motif Search) (11:34, 15 February 2023)
- PMS (Motif Search Motif Search) (11:34, 15 February 2023)
- Brute Force (Rod-Cutting Problem Rod-Cutting Problem) (11:34, 15 February 2023)
- Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem) (11:34, 15 February 2023)
- Brute Force (Change-Making Problem Change-Making Problem) (11:34, 15 February 2023)
- Dynamic Programming (Change-Making Problem Change-Making Problem) (11:34, 15 February 2023)
- Chandra (Approximate MCOP Matrix Chain Multiplication) (11:34, 15 February 2023)
- Chin (Approximate MCOP Matrix Chain Multiplication) (11:34, 15 February 2023)
- Bini's algorithm (Matrix Multiplication Matrix Product) (11:34, 15 February 2023)
- Karger, Blum ( Graph Coloring) (11:34, 15 February 2023)
- Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem) (11:34, 15 February 2023)
- Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem) (11:34, 15 February 2023)
- Harris and Stephens algorithm ( Corner Detection) (11:34, 15 February 2023)
- L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection) (11:35, 15 February 2023)
- The SUSAN corner detector ( Corner Detection) (11:35, 15 February 2023)
- Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem) (11:35, 15 February 2023)
- Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) (11:35, 15 February 2023)
- Roth AlignACE (Motif Search Motif Search) (11:35, 15 February 2023)
- Petro Vlahos Algorithm (Image Compositing Image Compositing) (11:35, 15 February 2023)
- Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) (11:35, 15 February 2023)
- R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis) (11:35, 15 February 2023)
- Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis) (11:35, 15 February 2023)
- Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring) (11:35, 15 February 2023)
- Khuller; Matias Randomized Sieve ( Closest Pair Problem) (11:35, 15 February 2023)
- Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition) (11:35, 15 February 2023)
- Bitap algorithm (Single String Search String Search) (11:35, 15 February 2023)
- Tim Sort (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Cube Sort Parallel Implementation (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Shell Sort; (Shell) (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Shell Sort; (Frank & Lazarus) (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Shell Sort; (Pratt) (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Shell Sort; (Sedgewick) (Comparison Sorting Sorting) (11:35, 15 February 2023)
- Bead Sort (Non-Comparison Sorting Sorting) (11:35, 15 February 2023)
- Burst Sort (Non-Comparison Sorting Sorting) (11:35, 15 February 2023)
- Hashing (kth Order Statistic kth Order Statistic) (11:35, 15 February 2023)
- Hunt and Szymanski (LCS Longest Common Subsequence) (11:35, 15 February 2023)
- Mukhopadhyay (LCS Longest Common Subsequence) (11:35, 15 February 2023)
- Cherkassky ( Maximum Flow) (11:35, 15 February 2023)
- James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow) (11:36, 15 February 2023)
- Schiermeyer (3-Graph Coloring Graph Coloring) (11:36, 15 February 2023)
- Lawler (4-Graph Coloring Graph Coloring) (11:36, 15 February 2023)
- Byskov (4-Graph Coloring Graph Coloring) (11:36, 15 February 2023)
- Conjugate Gradient (Approximation? with positive definite matrix Linear System) (11:36, 15 February 2023)
- Karmarkar's algorithm ( Linear Programming) (11:36, 15 February 2023)
- Affine scaling ( Linear Programming) (11:36, 15 February 2023)
- CHAZELLE (Reporting all intersection points, line segments Line segment intersection) (11:36, 15 February 2023)
- W. Eddy Quickhull (2-dimensional Convex Hull) (11:36, 15 February 2023)
- Andrew's algorithm (2-dimensional Convex Hull) (11:36, 15 February 2023)
- The ultimate planar convex hull algorithm (2-dimensional Convex Hull) (11:36, 15 February 2023)
- Chan's algorithm (2-dimensional; 3-dimensional Convex Hull) (11:36, 15 February 2023)
- Kosaraju's algorithm (SCCs Strongly Connected Components) (11:36, 15 February 2023)
- Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Pearce (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Path-based depth-first search Gabow (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Paul Purdom (Transitive Closure Strongly Connected Components) (11:37, 15 February 2023)
- Lowe’s Algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Renault’s Algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Couvreur (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- OBF Algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- CH Algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Hong’s algorithm (SCCs Strongly Connected Components) (11:37, 15 February 2023)
- Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) (11:37, 15 February 2023)
- Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (11:37, 15 February 2023)
- Dyer (2-dimensional array representation Closest Pair Problem) (11:37, 15 February 2023)
- Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (11:37, 15 February 2023)
- Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (11:38, 15 February 2023)
- Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring) (11:38, 15 February 2023)
- Quadratic sieve (Second Category Integer Factoring Integer Factoring) (11:38, 15 February 2023)
- Rational sieve (Second Category Integer Factoring Integer Factoring) (11:38, 15 February 2023)
- Closed formula ( LU Decomposition) (11:38, 15 February 2023)
- Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition) (11:38, 15 February 2023)
- David ( LU Decomposition) (11:38, 15 February 2023)
- Greedy Best-First Search (Informed Search Informed Search) (11:38, 15 February 2023)
- Incremental Heuristic Search ( Informed Search) (11:38, 15 February 2023)
- Block A* (Informed Search Informed Search) (11:38, 15 February 2023)
- D* (Informed Search Informed Search) (11:38, 15 February 2023)
- Field D* (Informed Search Informed Search) (11:38, 15 February 2023)
- Fringe (Informed Search Informed Search) (11:38, 15 February 2023)
- Tuned Boyer-Moore algorithm (Single String Search String Search) (11:38, 15 February 2023)
- FOGSAA (Edit sequence, global alignment Sequence Alignment) (11:38, 15 February 2023)
- Skala (convex and non-convex polyhedral window Line Clipping) (11:38, 15 February 2023)
- Lamport's bakery algorithm ( Mutual Exclusion) (11:39, 15 February 2023)
- Szymanski's algorithm ( Mutual Exclusion) (11:39, 15 February 2023)
- Taubenfeld's black-white bakery algorithm ( Mutual Exclusion) (11:39, 15 February 2023)
- Maekawa's algorithm ( Mutual Exclusion) (11:39, 15 February 2023)
- Suzuki-Kasami's algorithm ( Mutual Exclusion) (11:39, 15 February 2023)
- Painter's algorithm/Newell's algorithm ( Shown Surface Determination) (11:39, 15 February 2023)
- Warnock's algorithm ( Shown Surface Determination) (11:39, 15 February 2023)
- Ray tracing ( Shown Surface Determination) (11:39, 15 February 2023)
- Binary space partitioning (BSP) ( Shown Surface Determination) (11:39, 15 February 2023)
- Z-buffering ( Shown Surface Determination) (11:39, 15 February 2023)
- S-buffer/Scanline Rendering ( Shown Surface Determination) (11:39, 15 February 2023)
- Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) (11:39, 15 February 2023)
- Fortune ( Delaunay triangulation) (11:39, 15 February 2023)
- Gries (1D Maximum Subarray Maximum Subarray Problem) (11:39, 15 February 2023)
- Bird (1D Maximum Subarray Maximum Subarray Problem) (11:39, 15 February 2023)
- Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance) (11:39, 15 February 2023)
- Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance) (11:39, 15 February 2023)
- Applegate et al. (Approximate TSP The Traveling-Salesman Problem) (11:39, 15 February 2023)
- Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem) (11:39, 15 February 2023)
- Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem) (11:39, 15 February 2023)
- Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem) (11:39, 15 February 2023)
- Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem) (11:39, 15 February 2023)
- Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) (11:39, 15 February 2023)
- Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly) (11:39, 15 February 2023)
- Dürer rendering algorithm ( Ray Tracing) (11:39, 15 February 2023)
- Appel's algorithm 1968 ( Ray Tracing) (11:39, 15 February 2023)
- Whitted's algorithm 1979 ( Ray Tracing) (11:39, 15 February 2023)
- J.-C. Nebel 1998 ( Ray Tracing) (11:39, 15 February 2023)
- A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing) (11:39, 15 February 2023)
- Moravec's algorithm 1980 (Corner Detection Feature Detection) (11:39, 15 February 2023)
- J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) (11:39, 15 February 2023)
- Lindeberg (1994) (Corner Detection Feature Detection) (11:39, 15 February 2023)
- Lindeberg (1998) (Corner Detection Feature Detection) (11:39, 15 February 2023)
- K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection) (11:39, 15 February 2023)
- Lowe (2004) (Corner Detection Feature Detection) (11:39, 15 February 2023)
- T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) (11:39, 15 February 2023)
- Lindeberg 2005 (Corner Detection Feature Detection) (11:39, 15 February 2023)
- The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) (11:40, 15 February 2023)
- The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) (11:40, 15 February 2023)
- FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) (11:40, 15 February 2023)
- Trujillo and Olague 2008 (Corner Detection Feature Detection) (11:40, 15 February 2023)
- Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) (11:40, 15 February 2023)
- Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) (11:40, 15 February 2023)
- T. Lindeberg DoG 2012 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- SURF Descriptor 2006 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- A. Baumberg. 2000 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) (11:40, 15 February 2023)
- View frustum culling (Culling Culling) (11:40, 15 February 2023)
- Sector-Based Culling (Culling Culling) (11:40, 15 February 2023)
- Occlusion Culling (Culling Culling) (11:40, 15 February 2023)
- Contribution Culling (Culling Culling) (11:40, 15 February 2023)
- Kwatra 2003 (Texture Synthesis Texture Synthesis) (11:40, 15 February 2023)
- CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis) (11:40, 15 February 2023)
- P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- H.W.Jensen 2001 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- He; X. D.; Torrance; K. E.; Sillion; 1991 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Cabral; B.; Max; N.; and Springmeyer; R 1990 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (11:40, 15 February 2023)
- Phong (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Blinn–Phong (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Cook–Torrance (microfacets) (Specular Reflection Texture Mapping) (11:40, 15 February 2023)
- Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) (11:40, 15 February 2023)
- Recursive Region Splitting ( Image Segmentation) (11:40, 15 February 2023)
- R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) (11:41, 15 February 2023)
- Kass; Witkin and Terzopoulos ( Image Segmentation) (11:41, 15 February 2023)
- S.L. Horowitz and T. Pavlidis - directed split and merge ( Image Segmentation) (11:41, 15 February 2023)
- David Mumford and Jayant Shah (1989) ( Image Segmentation) (11:41, 15 February 2023)
- Geman and Geman Markov random fields ( Image Segmentation) (11:41, 15 February 2023)
- Iterated conditional modes algorithm ( Image Segmentation) (11:41, 15 February 2023)
- Watershed transformation 1979 ( Image Segmentation) (11:41, 15 February 2023)
- Topological watershed ( Image Segmentation) (11:41, 15 February 2023)
- Florack and Kuijper ( Image Segmentation) (11:41, 15 February 2023)
- Bijaoui and Rué ( Image Segmentation) (11:41, 15 February 2023)
- Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) (11:41, 15 February 2023)
- Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) (11:41, 15 February 2023)
- Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) (11:41, 15 February 2023)
- Coplanar facets merging - M.J. De Haemer and M.J. Zyda 1991 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - Hinker; P. and Hansen; C. 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - Kalvin; A. D.; Cutting; C. B.; Haddad; B. and Noz; M. E. 1991 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Coplanar facets merging - A.D. Kalvin and R.H. Taylor 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - M.E. Algorri and F. Schmitt 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Guéziec 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - R. Ronfard and J. Rossignac 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Hamann 1994 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Controlled vertex/edge/face decimation - Cohen; J.; Varshney; A 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Re-tiling - Turk; G 1992 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Rossignac; J. and Borrel; P. 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Low; K. L. and Tan; T. S 1997 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Reddy 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Hoppe; H.; DeRose; T.; 1993 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Vertex clustering - Rossignac; J. and Borrel; P. 1997 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) (11:41, 15 February 2023)
- Hauskrecht; 2000; (POMDPs POMDPs) (11:41, 15 February 2023)
- Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) (11:41, 15 February 2023)
- Braziunas & Boutilier; 2004; (POMDPs POMDPs) (11:41, 15 February 2023)