Pages with the fewest revisions
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)
- Homotopy method (All eigenpairs; Eigenpair closest to mu; Any eigenpair; Any eigenvalue; All eigenvalues Eigenvalues (Iterative Methods)) (1 revision)
- Hong’s algorithm (SCCs Strongly Connected Components) (1 revision)
- Hopcroft's DFA Algorithm (1 revision)
- Hopcroft's algorithm (DFA Minimization DFA Minimization) (1 revision)
- Hopcroft–Karp algorithm (1 revision)
- Householder's Method (Root Computation with continuous derivatives (up to d) Root Computation) (1 revision)
- Howard Policy Iteration (PI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- Hsu and Du (Scheme 1) (LCS Longest Common Subsequence) (1 revision)
- Hsu and Du (Scheme 2) (LCS Longest Common Subsequence) (1 revision)
- Hungarian Algorithm (1 revision)
- Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight Matching) (1 revision)
- Hunt and Szymanski (LCS Longest Common Subsequence) (1 revision)
- Hu–Tucker algorithm (Alphabetic Tree Problem Optimal Binary Search Trees) (1 revision)
- Hybrid Algorithm (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- HyperLogLog++ ( Cardinality Estimation) (1 revision)
- HyperLogLog algorithm ( Cardinality Estimation) (1 revision)
- IDEA (Block Ciphers Block Ciphers) (1 revision)
- INDEGREE analysis (1 revision)
- ITP Method (General Root Computation Root Computation) (1 revision)
- Illinois Algorithm (General Root Computation Root Computation) (1 revision)
- Image Compositing (1 revision)
- Image Processing (1 revision)
- Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis) (1 revision)
- Improvement Rankings (1 revision)
- Incremental Heuristic Search ( Informed Search) (1 revision)
- Index calculus algorithm (Discrete Logarithm Over Finite Fields, F q Logarithm Calculations) (1 revision)
- Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem) (1 revision)
- Integer relation (1 revision)
- Inverse iteration (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Inverse quadratic interpolation (General Root Computation Root Computation) (1 revision)
- Irving's Algorithm (Stable Roommates Problem Stable Matching Problem) (1 revision)
- Isometric graph partitioning - Leo Grady and Eric L. Schwartz (2006) ( Image Segmentation) (1 revision)
- Iterated conditional modes algorithm ( Image Segmentation) (1 revision)
- Iterative Deepening A* (IDA*) (Informed Search Informed Search) (1 revision)
- Ives' algorithm c ( All permutations) (1 revision)
- J.-C. Nebel 1998 ( Ray Tracing) (1 revision)
- J. Chen; L. Liu; and W. Jia. (The Vertex Cover Problem, Degrees Bounded By 3 The Vertex Cover Problem) (1 revision)
- J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) (1 revision)
- Jacobi eigenvalue algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Jalali and T. Weissman (Lossy Compression Data Compression) (1 revision)
- James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow) (1 revision)
- Jarvis Scan (1 revision)
- Jeh and Widom (Link Analysis Link Analysis) (1 revision)
- Jiang, Song, Weinstein and Zhang ( Linear Programming) (1 revision)
- Johnson's algorithm (Directed, Weighted (Arbitrary weights) All-Pairs Shortest Paths (APSP)) (1 revision)
- Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem) (1 revision)
- Johnson (3-Graph Coloring Graph Coloring) (1 revision)
- Johnson (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching) (1 revision)
- Jump Point Search (JPS) (Informed Search Informed Search) (1 revision)
- K-ANNS for a dense 3D map of geometric points (1 revision)
- K-Clique Hypothesis (1 revision)
- K-OV Hypothesis (1 revision)
- K-d Tree (1 revision)
- K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection) (1 revision)
- KALYAN PERUMALLA and NARSINGH DEO (2-dimensional Maximum subarray problem) (1 revision)
- KARNI Z.; GOTSMAN C.; GORTLER S. J. 2005 (Mesh Parameterization Mesh Parameterization) (1 revision)
- K Riesen (Inexact GED Graph Edit Distance Computation) (1 revision)
- Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) (1 revision)
- Kahn's Algorithm (1 revision)
- Kajiya; J. Anisotropic Reflection Models 1985 (Diffuse Reflection Texture Mapping) (1 revision)
- Kalman Filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Karatsuba Algorithm (1 revision)
- Karger, Blum ( Graph Coloring) (1 revision)
- Karmarkar's algorithm ( Linear Programming) (1 revision)
- Karpinski (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Karzanov ( Maximum Flow) (1 revision)
- Kass; Witkin and Terzopoulos ( Image Segmentation) (1 revision)
- Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems) (1 revision)
- Key exchange (1 revision)
- Khachiyan Ellipsoid Algorithm (1 revision)
- Khuller, Matias (k-dimensional space, Euclidean metric Closest Pair Problem) (1 revision)
- Khuller; Matias ( Closest Pair Problem) (1 revision)
- Khuller; Matias Randomized Sieve ( Closest Pair Problem) (1 revision)
- Kingsford (Motif Search Motif Search) (1 revision)
- Kingsford ( Motif Search) (1 revision)
- Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees) (1 revision)
- Klein (section 5) (Planar Bipartite Graph Perfect Matching Maximum Cardinality Matching) (1 revision)
- Kleinberg (Link Analysis Link Analysis) (1 revision)
- Kleitman–Wang Algorithm (Digraph Realization Problem Graph Realization Problems) (1 revision)
- Klinz (Subset Sum The Subset-Sum Problem) (1 revision)
- Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Knuth's DP Algorithm (1 revision)
- Knuth's DP algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Knuth-Morris-Pratt Algorithm (1 revision)
- Knuth–Bendix algorithm (Coset Enumeration Coset Enumeration) (1 revision)
- Knuth–Bendix algorithm (General Groups (uncompleted?) Coset Enumeration) (1 revision)
- Koivisto ( Chromatic Number) (1 revision)
- Koivisto ( Chromatic Polynomial) (1 revision)
- Kong and Wilken Algorithm (Global Register Allocation Register Allocation) (1 revision)
- Korada and R. Urbanke; (Lossy Compression Data Compression) (1 revision)
- Kruskal's Algorithm (1 revision)
- Kth order statistic (1 revision)
- Kuo and Cross (LCS Longest Common Subsequence) (1 revision)
- Kushner non-linear filter (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- Kwatra 2003 (Texture Synthesis Texture Synthesis) (1 revision)
- L. Kitchen and A. Rosenfeld (Corner Detection Feature Detection) (1 revision)
- L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection) (1 revision)
- LLL algorithm (Integer Relation Integer Relation) (1 revision)
- LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- LU Matrix Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- LU decomposition (1 revision)
- LU decomposition (General Linear system of equations) (1 revision)
- L Chang (Inexact GED Graph Edit Distance Computation) (1 revision)
- Laguerre iteration (Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Lamport's bakery algorithm ( Mutual Exclusion) (1 revision)
- Langdon ( All permutations) (1 revision)
- Larmore (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV)) (1 revision)
- Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV)) (1 revision)
- Lawler's Graph Coloring Algorithm (1 revision)
- Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- Lawler (4-Graph Coloring Graph Coloring) (1 revision)
- Lawler ( Chromatic Number) (1 revision)
- Lawrence, Reilly (Motif Search Motif Search) (1 revision)
- Lawrence Gibbs Sampling (Motif Search Motif Search) (1 revision)
- Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) (1 revision)
- Least recently used (Online Page Replacements) (1 revision)
- Lee, Sidford ( Maximum Flow) (1 revision)
- Lee; Peng; Spielman (Inexact Laplacian Solver SDD Systems Solvers) (1 revision)
- Lehmer's GCD algorithm (Greatest Common Divisor Greatest Common Divisor) (1 revision)
- Lemke-Howson Algorithm (2 player games Nash Equilibria) (1 revision)
- Lemke–Howson Algorithm (1 revision)
- Lemke–Howson algorithm (1 revision)
- Lemke–Howson algorithm (2-player Nash Equilibria) (1 revision)
- Levcopoulos; Lingas; Sack (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Levinson–Durbin recursion (Toeplitz Matrix Linear System) (1 revision)
- Lewis 1978 (Renamable Horn Boolean Satisfiability) (1 revision)
- Liang Cwinnower (Motif Search Motif Search) (1 revision)
- Liang Cwinnower ( Motif Search) (1 revision)
- Lien (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) (1 revision)
- Lifelong Planning A* (LPA*) (Informed Search Informed Search) (1 revision)
- Linda G. Shapiro and George C. Stockman (2001) ( Image Segmentation) (1 revision)
- Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection) (1 revision)
- Lindeberg (1994) (Corner Detection Feature Detection) (1 revision)
- Lindeberg (1998) (Corner Detection Feature Detection) (1 revision)
- Lindeberg 2005 (Corner Detection Feature Detection) (1 revision)
- Linde–Buzo–Gray Algorithm (1 revision)
- Line Clipping (1 revision)
- Line Intersections (1 revision)
- Line drawing (1 revision)
- Linear Equations (1 revision)
- Linear Scan, Poletto & Sarkar (Global Register Allocation Register Allocation) (1 revision)
- Link analysis (PAGERANK and variants) (1 revision)
- Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem) (1 revision)
- Lipton, Markakis and Mehta method (2 player games Nash Equilibria) (1 revision)
- Lipton, Markakis and Mehta method 2 (n player games Nash Equilibria) (1 revision)
- Lipton; Mehta (2-player Nash Equilibria) (1 revision)
- List:Domains (1 revision)
- List:Hypotheses (1 revision)
- List:Problem Families (1 revision)
- Liu (Decisional BCNF BCNF Decomposition) (1 revision)
- Local scale-invariant Lowe 1999 (Blob Detection Feature Detection) (1 revision)
- Locality-sensitive hashing (k-ANNS Nearest Neighbor Search) (1 revision)
- Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) (1 revision)
- LogLog Algorithm (1 revision)
- LogLog algorithm ( Cardinality Estimation) (1 revision)
- Logarithm calculations (1 revision)
- Lokshtanov (Subset Sum The Subset-Sum Problem) (1 revision)
- Longest common subsequence (1 revision)
- Longest distance first (LDF) page replacement algorithm (Online Page Replacements) (1 revision)
- Longest palindromic substring (1 revision)
- Longest path on interval graphs (1 revision)
- Lossy compression (1 revision)
- Lowe (2004) (Corner Detection Feature Detection) (1 revision)
- Lowest common ancestor (1 revision)
- Lowe’s Algorithm (SCCs Strongly Connected Components) (1 revision)
- Lucifer / DES (Block Ciphers Block Ciphers) (1 revision)
- Lund & Yannakakis ( The Set-Covering Problem) (1 revision)
- MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) (1 revision)
- MD5 (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- MDPs for optimal policies (1 revision)
- MKM Algorithm ( Maximum Flow) (1 revision)
- MRRR algorithm (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Madry's algorithm (Bipartite Graph MCM Maximum Cardinality Matching) (1 revision)
- Madry ( Maximum Flow) (1 revision)
- Maekawa's algorithm ( Mutual Exclusion) (1 revision)
- Manlove; Malley (Stable Marriage Problem Stable Matching Problem) (1 revision)
- Masek, Paterson (Edit sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Masek, Paterson (Edit sequence Sequence Alignment) (1 revision)
- Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment) (1 revision)
- Masek; Patterson (Edit distance Sequence Alignment) (1 revision)
- Matrix Factorization for Collaborative Filtering (1 revision)
- Matrix chain multiplication (1 revision)
- Matrix inverse (General Linear system of equations) (1 revision)
- Matsunaga; Yamamoto (Lossy Compression Data Compression) (1 revision)
- Mauro Steigleder (Environment Mapping Texture Mapping) (1 revision)
- Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection) (1 revision)
- Maximum-weight matching (1 revision)
- Maximum Flow (1 revision)
- Maximum Inner Product Search (1 revision)
- Maximum a Posteriori Occupancy Mapping (Occupancy Grid Mapping Occupancy Grid Mapping) (1 revision)
- Maximum cardinality matching (1 revision)
- Maximum cut (1 revision)
- Maximum subarray problem (1 revision)
- Maxwell ( 4NF Decomposition) (1 revision)
- McAllester & Singh; 1999; (POMDPs POMDPs) (1 revision)
- McCreight (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- McKay ( Graph Isomorphism Problem) (1 revision)
- Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (1 revision)
- Mesh Simplification (1 revision)
- Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product) (1 revision)
- Method of Four Russians ( Matrix Multiplication) (1 revision)
- Micali, Vazirani (general graph Maximum cardinality matching) (1 revision)
- Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem) (1 revision)
- Miller and Myers (LCS Longest Common Subsequence) (1 revision)
- Min-Weight k-Clique Hypothesis (1 revision)
- Min. Spanning Tree (1 revision)
- Min/max sketches streaming algorithm (streaming Cardinality Estimation) (1 revision)
- Mitra (Motif Search Motif Search) (1 revision)
- Mixed Integer Programming (n player games Nash Equilibria) (1 revision)
- Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Modified van Leeuwen (Linking Roots) (Lowest Common Ancestor with Linking Roots Lowest Common Ancestor) (1 revision)
- Modified van Leeuwen (Static Trees) (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Money Change (1 revision)
- Moore's algorithm (DFA Minimization DFA Minimization) (1 revision)
- Moravec's algorithm 1980 (Corner Detection Feature Detection) (1 revision)
- More Believable Exponential Time Hypothesis (MBETH) (1 revision)
- MotifSampler (Motif Search Motif Search) (1 revision)
- Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching) (1 revision)
- Mucha and Sankowski ( Maximum-Weight Matching) (1 revision)
- Mukhopadhyay (LCS Longest Common Subsequence) (1 revision)
- Muller's method (General Root Computation Root Computation) (1 revision)
- Multi-scale MAP estimation - A. Bouman and M. Shapiro (2002) ( Image Segmentation) (1 revision)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Multiple Resolution segmentation - J. Liu and Y. H. Yang (1994) ( Image Segmentation) (1 revision)
- Multistep (SCCs Strongly Connected Components) (1 revision)
- Muzychuk (Circulant graphs Graph Isomorphism Problem) (1 revision)
- Myers and Miller (Edit sequence, local alignment Sequence Alignment) (1 revision)
- N-Queens Problem (1 revision)
- N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull) (1 revision)
- NIEVERGELT. J.. AND PREPARATA (Section 2) (Reporting all intersection points / general polygons Line segment intersection) (1 revision)
- Naive (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Naive ( 4NF Decomposition) (1 revision)
- Naive + 1 queen per row restriction (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Naive Algorithm (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Naive Implementation (Exact Laplacian Solver SDD Systems Solvers) (1 revision)
- Naive Implementation ( Integral Equations) (1 revision)
- Naive algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation) (1 revision)
- Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform) (1 revision)
- Naive algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Naive algorithm (OBST Optimal Binary Search Trees) (1 revision)
- Naive solution ( Cardinality Estimation) (1 revision)
- Naive solution ( Frequent Words with Mismatches Problem) (1 revision)
- Nakamae; E.; Kaneda; K.; Okamoto; T.; and Nishita 1990 (Diffuse Reflection Texture Mapping) (1 revision)
- Nakatsu et al. (LCS Longest Common Subsequence) (1 revision)
- Nash Equilibria (1 revision)
- Nate Green (Environment Mapping Texture Mapping) (1 revision)
- Nauck (Counting Solutions; Constructing solutions n-Queens Problem) (1 revision)
- Naïve string-search algorithm (Single String Search String Search) (1 revision)
- Nearest Neighbour (1 revision)
- Needleman–Wunsch algorithm (1 revision)
- Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment) (1 revision)
- Nesetril, Poljak (k-Clique k-Clique Problem) (1 revision)
- Nested Loop Join (1 revision)
- Neuhaus, Riesen, Bunke (Inexact GED Graph Edit Distance Computation) (1 revision)
- Newton's method (Root Computation with continuous first derivative Root Computation) (1 revision)
- Newton–Raphson algorithm ( Maximum Likelihood Parameters) (1 revision)
- Niedermeier, Rossmanith (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Nivasch (Cycle Detection Cycle Detection) (1 revision)
- Nivasch ( Cycle Detection) (1 revision)
- No-Steal, Force (1 revision)
- No-Steal/Force (1 revision)
- Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) (1 revision)
- Non-priority optimal interval Scheduling (1 revision)
- Nondeterministic Strong Exponential Time Hypothesis (NSETH) (1 revision)
- Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Not frequently used (NFU) (Online Page Replacements) (1 revision)
- Not recently used (Online Page Replacements) (1 revision)
- Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Numerical Analysis (1 revision)
- O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) (1 revision)
- OBF Algorithm (SCCs Strongly Connected Components) (1 revision)
- Occlusion Culling (Culling Culling) (1 revision)
- Occupancy Grid Mapping (1 revision)
- Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Odd Even Sort Parallel Implementation (Comparison Sorting Sorting) (1 revision)
- Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) (1 revision)
- Online 2-d Convex Hull, Preparata (2-dimensional Convex Hull, Online Convex Hull) (1 revision)
- Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis) (1 revision)
- Operating Systems (1 revision)
- Ord-Smith ( All permutations) (1 revision)
- Orthogonal Vectors Hypothesis (OVH) (1 revision)
- Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) (1 revision)
- Outside-In algorithm (Turnpike Problem Turnpike Problem) (1 revision)
- Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- P.Hanrahan and W.Krueger 1993 (Diffuse Reflection Texture Mapping) (1 revision)
- P. Costantini, B. I. Kvasov, and C. Manni (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- P. Costantini; B. I. Kvasov; and C. Manni 1999 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) (1 revision)
- PHITS Coheng Chan (Link Analysis Link Analysis) (1 revision)
- PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization) (1 revision)
- PMS (Motif Search Motif Search) (1 revision)
- POMDPs (1 revision)
- PSLQ algorithm (Integer Relation Integer Relation) (1 revision)
- PSOS algorithm (Integer Relation Integer Relation) (1 revision)
- Page replacements (1 revision)
- Painter's algorithm/Newell's algorithm ( Shown Surface Determination) (1 revision)
- Pan's algorithm (Matrix Multiplication Matrix Product) (1 revision)
- Papadimitriou and M Yannakakis (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Papadimitriou and M Yannakakis 1996 + Buss (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Paquet; Tobin; & Chaib-draa; 2005; (POMDPs POMDPs) (1 revision)
- Parallel Merge Sort - Cole (1) ( Sorting - Comparison) (1 revision)
- Parallel Merge Sort - Cole (2) ( Sorting - Comparison) (1 revision)
- Parameter-expanded expectation maximization (PX-EM) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables) (1 revision)
- Parameter-expanded expectation maximization (PX-EM) algorithm ( Maximum Likelihood Parameters) (1 revision)
- Parametrized Inapproximability Hypothesis (PIH) (1 revision)
- Parsing (1 revision)
- Particle filter Del Moral (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)
- Path-based depth-first search Gabow (SCCs Strongly Connected Components) (1 revision)
- Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components) (1 revision)
- Patrick Posser (Stable Roommates Problem Stable Matching Problem) (1 revision)
- Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability) (1 revision)
- Paul Purdom (Transitive Closure Strongly Connected Components) (1 revision)
- Pearce (SCCs Strongly Connected Components) (1 revision)
- Peng, Vempala (Sparse Linear system of equations) (1 revision)
- Peterson's algorithm ( Mutual Exclusion) (1 revision)
- Petro Vlahos Algorithm (Image Compositing Image Compositing) (1 revision)
- Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Pferschy (Subset Sum The Subset-Sum Problem) (1 revision)
- Phong (Specular Reflection Texture Mapping) (1 revision)
- Pineau; Gordon; & Thrun; 2003; (POMDPs POMDPs) (1 revision)
- Pisinger (Subset Sum The Subset-Sum Problem) (1 revision)
- Pohlig-Hellman (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Point in Polygon (1 revision)
- Pollard's kangaroo algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Pollard's rho algorithm (Discrete Logarithm Over Finite Fields Logarithm Calculations) (1 revision)
- Polygon clipping (1 revision)
- Polynomial interpolation (1 revision)
- Poupart; 2005; (POMDPs POMDPs) (1 revision)
- Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Prakesh Ramanan (Approximate MCOP Matrix Chain Multiplication) (1 revision)
- Pratt (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon) (1 revision)
- Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST)) (1 revision)
- Priority Queue Algorithm (Duplicate Elimination Duplicate Elimination) (1 revision)
- Priority scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Priority scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search) (1 revision)
- Projected radial search (k Approximate Nearest Neighbors Search (k-ANNS) for a dense 3D map of geometric points Nearest Neighbor Search) (1 revision)
- Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs) (1 revision)
- QR Matrix Decomposition (Matrix Factorization Collaborative Filtering) (1 revision)
- QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods)) (1 revision)
- Quadratic Sieve (1 revision)
- Quadratic sieve (Second Category Integer Factoring Integer Factoring) (1 revision)
- Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability) (1 revision)
- Quick-Skip Searching (Single String Search String Search) (1 revision)
- R. Nock and F. Nielsen Statistical Region Merging ( Image Segmentation) (1 revision)
- R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis) (1 revision)
- RC5 (Block Ciphers Block Ciphers) (1 revision)
- RIPEMD-160 (Unkeyed Hash Functions One-Way Hash Functions) (1 revision)
- Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (1 revision)
- Rabin-Karp (RK) algorithm (Single String Search String Search) (1 revision)
- Rabin–Scott Powerset Construction (1 revision)
- Rabin–Scott powerset construction ( NFA to DFA conversion) (1 revision)
- Radix Sort (1 revision)
- Radix Sort (Non-Comparison Sorting Sorting) (1 revision)
- Radix sorting method (General Permutations Generating Random Permutations) (1 revision)
- Raita Algorithm (Single String Search String Search) (1 revision)
- Ramer–Douglas–Peucker Algorithm (1 revision)
- Random (Online Page Replacements) (1 revision)
- Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem) (1 revision)
- Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition) (1 revision)
- Rasterization (1 revision)
- Rational sieve (Second Category Integer Factoring Integer Factoring) (1 revision)
- The vertex-cover problem (1 revision)
- Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull) (1 revision)
- Self-balancing trees creation (1 revision)
- Self-balancing trees deletion (1 revision)
- Self-balancing trees insertion (1 revision)
- Self-balancing trees search (1 revision)
- Sequence Alignment (1 revision)
- Sequence to Graph Alignment (1 revision)
- Sethi–Ullman Algorithm (Arithmetic Expression Binary Tree AST to Code Translation) (1 revision)
- Shamir's scheme ( Secret Sharing) (1 revision)
- Shani; Brafman; & Shimony; 2005 (POMDPs POMDPs) (1 revision)
- Shell Sort; (Frank & Lazarus) (Comparison Sorting Sorting) (1 revision)
- Shell Sort; (Pratt) (Comparison Sorting Sorting) (1 revision)
- Shell Sort; (Sedgewick) (Comparison Sorting Sorting) (1 revision)
- Shell Sort; (Shell) (Comparison Sorting Sorting) (1 revision)
- Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting) (1 revision)
- Shell Sort (Pratt) (Comparison Sorting Sorting) (1 revision)
- Shell Sort (Sedgewick) (Comparison Sorting Sorting) (1 revision)
- Shell Sort (Shell) (Comparison Sorting Sorting) (1 revision)
- Shi 2009 (NAE 3SAT Boolean Satisfiability) (1 revision)
- Shiloach ( Maximum Flow) (1 revision)
- Shor's algorithm Quantum Implementation (Second Category Integer Factoring Integer Factoring) (1 revision)
- Shortest Path(Directed graphs) (1 revision)
- Shortest remaining time first (Unweighted Interval Scheduling, Online?? Interval Scheduling) (1 revision)
- Shortest remaining time first (Unweighted Interval Scheduling, Online Interval Scheduling) (1 revision)
- Simplification via intermediate hierarchical rep-resentation - Andujar 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Simplification via intermediate hierarchical rep-resentation - He; T.; Hong; L.; Kaufman 1995 (Mesh Simplification Mesh Simplification) (1 revision)
- Simplified Memory-Bounded A* (SMA*) (Informed Search Informed Search) (1 revision)
- Sinha S; Tompa M YMF (Yeast Motif Finder) (Motif Search Motif Search) (1 revision)
- Sinha S; Tompa M YMF (Yeast Motif Finder) ( Motif Search) (1 revision)
- Skala (convex and non-convex polyhedral window Line Clipping) (1 revision)
- Sleator and Tarjan (Linking) (Lowest Common Ancestor with Linking Lowest Common Ancestor) (1 revision)
- Sleator and Tarjan (Linking and Cutting) (Lowest Common Ancestor with Linking and Cutting Lowest Common Ancestor) (1 revision)
- Smith & Simmons; 2005; (POMDPs POMDPs) (1 revision)
- Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment) (1 revision)
- Sorted Neighborhood Algorithm (SNA) (Duplicate Elimination Duplicate Elimination) (1 revision)
- Sorting - Comparison (1 revision)
- Sorting - Non-Comparison (1 revision)
- Spaan & Vlassis; 2005 (POMDPs POMDPs) (1 revision)
- Spaghetti Sort Parallel Implementation (Non-Comparison Sorting Sorting) (1 revision)
- Sparse APSP algorithm (Arbitrary edge weights, Sparse graph Graph Diameter) (1 revision)
- Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) (1 revision)
- Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection) (1 revision)
- Special number field sieve (First Category Integer Factoring Integer Factoring) (1 revision)
- Speller (Motif Search Motif Search) (1 revision)
- Sphere mapping (Environment Mapping Texture Mapping) (1 revision)
- Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem) (1 revision)
- Square-free factorization (Square-free Factorization of Polynomials Over Finite Fields) (1 revision)
- Stable Marriage Problem/Stable Roommates Problem (1 revision)
- Statistics (1 revision)
- Steal/No-Force (1 revision)
- Steffensen's method (General Root Computation Root Computation) (1 revision)
- Stege, Fellows (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Stege, Fellows + Interleaving method (Niedermeier, Rossmanith) (The Vertex Cover Problem The Vertex Cover Problem) (1 revision)
- Stephen Alstrup, Cyril Gavoille, Haim Kaplan & Theis Rauhe (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) (1 revision)
- Strassen's Algorithm (1 revision)
- String-Matching with Finite Automata (Single String Search String Search) (1 revision)
- String Graph with Ferragina–Manzini Index (Simpson, Durbin) (De Novo Genome Assembly De Novo Genome Assembly) (1 revision)
- String Search (1 revision)
- Strong Exponential Time Hypothesis (SETH) (1 revision)
- Strong Triangle Conjecture (1 revision)
- Subgradient method (General, Constrained optimization Convex Optimization (Non-linear)) (1 revision)
- Support enumeration and search (n player games Nash Equilibria) (1 revision)
- Suzuki-Kasami's algorithm ( Mutual Exclusion) (1 revision)
- Szymanski's algorithm ( Mutual Exclusion) (1 revision)
- Süleyman Cenk Sahinalp ; Uzi Vishkin (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- T. Lindeberg DoG 2012 (Blob Detection Feature Detection) (1 revision)
- T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection) (1 revision)
- T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection) (1 revision)
- Takaoka (2-dimensional Maximum subarray problem) (1 revision)
- Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem) (1 revision)
- Tamaki, Tokuyama (exact) (2-dimensional Maximum subarray problem) (1 revision)
- Tango Tree ( Self-Balancing Trees Creation) (1 revision)
- Tango Tree ( Self-Balancing Trees Search) (1 revision)
- Tao D; Tang X; Li X et al ( Graph Edit Distance Computation) (1 revision)
- Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection) (1 revision)
- Tarjan's LCA Algorithm (1 revision)
- Tarjan's SSC Algorithm (1 revision)
- Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components) (1 revision)
- Tarjan (directed, dense) (Directed (Optimum Branchings), Super Dense MST Minimum Spanning Tree (MST)) (1 revision)
- Tarjan (directed, general) (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) (1 revision)
- Tarjan Splay Tree ( Self-Balancing Trees Deletion) (1 revision)
- Tarjan Splay Tree ( Self-Balancing Trees Insertion) (1 revision)
- Tarjan Splay Tree ( Self-Balancing Trees Search) (1 revision)
- Taubenfeld's black-white bakery algorithm ( Mutual Exclusion) (1 revision)
- Template Page (1 revision)
- Textbook Sort-and-Binary-Search (Integer 3SUM 3SUM) (1 revision)
- Textbook Sort-and-Two-Sided-Traversal (Integer 3SUM 3SUM) (1 revision)
- The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis) (1 revision)
- The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis) (1 revision)
- The Algorithm of Park; Chen; and Yu (PCY) (Finding Frequent Itemsets Finding Frequent Itemsets) (1 revision)
- The Multihash Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (1 revision)
- The Multistage Algorithm (Finding Frequent Itemsets Finding Frequent Itemsets) (1 revision)
- The PAGERANK Algorithm (Link Analysis Link Analysis) (1 revision)
- The SUSAN corner detector (Corner Detection Feature Detection) (1 revision)
- The SUSAN corner detector ( Corner Detection) (1 revision)
- The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection) (1 revision)
- The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection) (1 revision)
- The frequent words problem (1 revision)
- The set-covering problem (1 revision)
- The subset-sum problem (1 revision)
- The theoretically optimal page replacement algorithm (Offline Page Replacements) (1 revision)
- The traveling-salesman problem (1 revision)
- The ultimate planar convex hull algorithm (2-dimensional Convex Hull) (1 revision)
- Wheel Factorization (1 revision)
- Victor Shoup's algorithm (Equal-degree Factorization of Polynomials Over Finite Fields) (1 revision)
- View frustum culling (Culling Culling) (1 revision)
- Volterra Equations (1 revision)
- Vornoi Diagrams (1 revision)
- W. Eddy Quickhull (2-dimensional Convex Hull) (1 revision)
- Wagner-Fischer Algorithm (1 revision)
- Wagner-Fischer algorithm (Edit distance, constant-size alphabet Sequence Alignment) (1 revision)
- Wagner-Fischer algorithm (Edit distance Sequence Alignment) (1 revision)
- Wagner-Fischer algorithm (Edit sequence, constant-size alphabet Sequence Alignment) (1 revision)
- Wagner-Fischer algorithm (Edit sequence Sequence Alignment) (1 revision)
- WalkSAT (CNF-SAT Boolean Satisfiability) (1 revision)
- Warnock's algorithm ( Shown Surface Determination) (1 revision)
- Washington; 1997; (POMDPs POMDPs) (1 revision)
- Watershed transformation 1979 ( Image Segmentation) (1 revision)
- Wavelet-based - Certain; A.; Popovic; J.; 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Wavelet-based - D.J. Hebert and H-J. Kim 1995 (Mesh Simplification Mesh Simplification) (1 revision)
- Wavelet-based - Eck; M.; DeRose; T.; 1995 (Mesh Simplification Mesh Simplification) (1 revision)
- Wavelet-based - M.H. Gross; O.G. Staadt and R. Gatti 1996 (Mesh Simplification Mesh Simplification) (1 revision)
- Weak Parametrized Inapproximability Hypothesis (WPIH) (1 revision)
- Weighted Activity selection problem (1 revision)
- Weiner's algorithm (Constructing Suffix Trees Constructing Suffix Trees) (1 revision)
- Wells ( All permutations) (1 revision)
- Wen (1-dimensional Maximum subarray problem) (1 revision)
- Wen (2-dimensional Maximum subarray problem) (1 revision)
- Westin; S. H.; Arvo; J. R.; and Torrance; K. E 1992 (Diffuse Reflection Texture Mapping) (1 revision)
- Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) (1 revision)