Oldest pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #351 to #400.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- 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)