Short pages

Jump to navigation Jump to search

Showing below up to 250 results in range #251 to #500.

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

  1. (hist) ‎Gaussian-Jordan Elimination (General Linear System; Positive Definite, Hermitian Matrix; Non-Definite, Symmetric Matrix; Toeplitz Matrix; Vandermonde Matrix Linear System) ‎[270 bytes]
  2. (hist) ‎Cholesky (Positive Definite, Hermitian Matrix Linear System) ‎[270 bytes]
  3. (hist) ‎Prim's algorithm + binary heap (Undirected, General MST Minimum Spanning Tree (MST)) ‎[270 bytes]
  4. (hist) ‎Lewis 1978 (Renamable Horn Boolean Satisfiability) ‎[270 bytes]
  5. (hist) ‎CHEN Z. G.; LIU L. G.; ZHANG Z. Y.; WANG G. J. 2007 (Mesh Parameterization Mesh Parameterization) ‎[271 bytes]
  6. (hist) ‎Alberto Sanfeliu and King-Sun Fu ( Graph Edit Distance Computation) ‎[272 bytes]
  7. (hist) ‎Berger & Müller-Hannemann (DAG Realization Problem Graph Realization Problems) ‎[272 bytes]
  8. (hist) ‎Family:Matrix Chain Multiplication ‎[273 bytes]
  9. (hist) ‎SANDER P. V.; SNYDER J.; GORTER S. J.; HOPPE 2001 (Mesh Parameterization Mesh Parameterization) ‎[273 bytes]
  10. (hist) ‎Hirsch (3-Graph Coloring Graph Coloring) ‎[273 bytes]
  11. (hist) ‎FLOATER 1997 (Mesh Parameterization Mesh Parameterization) ‎[274 bytes]
  12. (hist) ‎PINKALL U.; POLTHIER K 1993 (Mesh Parameterization Mesh Parameterization) ‎[274 bytes]
  13. (hist) ‎Family:Linear Programming ‎[275 bytes]
  14. (hist) ‎String-Matching with Finite Automata (Single String Search String Search) ‎[275 bytes]
  15. (hist) ‎Micali; Vazirani ( Maximum-Weight Matching) ‎[276 bytes]
  16. (hist) ‎Fringe (Informed Search Informed Search) ‎[277 bytes]
  17. (hist) ‎SHEFFER A.; DE STURLER E. 2000 (Mesh Parameterization Mesh Parameterization) ‎[277 bytes]
  18. (hist) ‎SPRINGBORN B.; SCHROEDER P.; PINKALL U. 2008 (Mesh Parameterization Mesh Parameterization) ‎[277 bytes]
  19. (hist) ‎Zakai (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[277 bytes]
  20. (hist) ‎Zwick 2002 (Directed, Unweighted All-Pairs Shortest Paths (APSP)) ‎[277 bytes]
  21. (hist) ‎Naive algorithm (Matrix Multiplication Matrix Product) ‎[278 bytes]
  22. (hist) ‎Family:Nearest Neighbor Search ‎[279 bytes]
  23. (hist) ‎Simplex Algorithm ( Linear Programming) ‎[279 bytes]
  24. (hist) ‎Terlaky's Criss-cross algorithm ( Linear Programming) ‎[279 bytes]
  25. (hist) ‎Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[279 bytes]
  26. (hist) ‎Dinur & Steurer ( The Set-Covering Problem) ‎[279 bytes]
  27. (hist) ‎Alon and Kahale (3-Graph Coloring Graph Coloring) ‎[279 bytes]
  28. (hist) ‎Sorting based (Merge Sort) (Duplicate Elimination Duplicate Elimination) ‎[279 bytes]
  29. (hist) ‎Family:Clique Problems ‎[280 bytes]
  30. (hist) ‎Brute force (4-Graph Coloring Graph Coloring) ‎[280 bytes]
  31. (hist) ‎Raz & Safra ( The Set-Covering Problem) ‎[280 bytes]
  32. (hist) ‎Naive Selection (kth Order Statistic kth Order Statistic) ‎[281 bytes]
  33. (hist) ‎Tao D; Tang X; Li X et al ( Graph Edit Distance Computation) ‎[281 bytes]
  34. (hist) ‎Brute-force search (3-Graph Coloring Graph Coloring) ‎[284 bytes]
  35. (hist) ‎Parallel Merge Sort - Cole (1) ( Sorting - Comparison) ‎[284 bytes]
  36. (hist) ‎Parallel Merge Sort - Cole (2) ( Sorting - Comparison) ‎[284 bytes]
  37. (hist) ‎Grenander (1D Maximum Subarray Maximum Subarray Problem) ‎[285 bytes]
  38. (hist) ‎Hash join ( Joins) ‎[285 bytes]
  39. (hist) ‎Sciore (4NF Decomposition for Conflict-Free Dependency Sets 4NF Decomposition) ‎[285 bytes]
  40. (hist) ‎Chand-Kapur, Gift Wrapping (d-dimensional Convex Hull Convex Hull) ‎[286 bytes]
  41. (hist) ‎Ocone (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[287 bytes]
  42. (hist) ‎Bcrypt (Unkeyed Hash Functions One-Way Hash Functions) ‎[287 bytes]
  43. (hist) ‎Family:Interval Scheduling ‎[288 bytes]
  44. (hist) ‎Brute force (Lossy Compression Data Compression) ‎[288 bytes]
  45. (hist) ‎( Negative Triangle) ‎[288 bytes]
  46. (hist) ‎Wang Y-K; Fan K-C; Horng J-T ( Graph Edit Distance Computation) ‎[288 bytes]
  47. (hist) ‎Multilevel queue scheduling (Unweighted Interval Scheduling, Online?? Interval Scheduling) ‎[288 bytes]
  48. (hist) ‎Not recently used (Online Page Replacements) ‎[288 bytes]
  49. (hist) ‎First-in, first-out (Online Page Replacements) ‎[288 bytes]
  50. (hist) ‎Second-chance (Online Page Replacements) ‎[288 bytes]
  51. (hist) ‎Multilevel queue scheduling (Unweighted Interval Scheduling, Online Interval Scheduling) ‎[288 bytes]
  52. (hist) ‎Long Multiplication ( Multiplication) ‎[289 bytes]
  53. (hist) ‎Naive algorithm (Subset Sum The Subset-Sum Problem) ‎[289 bytes]
  54. (hist) ‎Shamos (1D Maximum Subarray Maximum Subarray Problem) ‎[290 bytes]
  55. (hist) ‎Linde–Buzo–Gray algorithm ( Voronoi Diagrams) ‎[291 bytes]
  56. (hist) ‎Feige ( The Set-Covering Problem) ‎[292 bytes]
  57. (hist) ‎Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms) ‎[292 bytes]
  58. (hist) ‎Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling) ‎[292 bytes]
  59. (hist) ‎Not frequently used (NFU) (Online Page Replacements) ‎[292 bytes]
  60. (hist) ‎Aging (Online Page Replacements) ‎[292 bytes]
  61. (hist) ‎Treap ( Self-Balancing Trees Insertion) ‎[292 bytes]
  62. (hist) ‎Treap ( Self-Balancing Trees Deletion) ‎[292 bytes]
  63. (hist) ‎Treap ( Self-Balancing Trees Search) ‎[292 bytes]
  64. (hist) ‎Mixed Integer Programming (n player games Nash Equilibria) ‎[292 bytes]
  65. (hist) ‎T. C. Hu ; M. T. Shing (Matrix Chain Ordering Problem Matrix Chain Multiplication) ‎[293 bytes]
  66. (hist) ‎Kvasov 2006 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[293 bytes]
  67. (hist) ‎Iteration based (Tower of Hanoi Tower of Hanoi) ‎[293 bytes]
  68. (hist) ‎Non-recursion based (Tower of Hanoi Tower of Hanoi) ‎[293 bytes]
  69. (hist) ‎Support enumeration and search (n player games Nash Equilibria) ‎[293 bytes]
  70. (hist) ‎Incremental convex hull algorithm; Michael Kallay ( Convex Hull) ‎[294 bytes]
  71. (hist) ‎Reduction from UOV to Dynamic Time Warping ‎[294 bytes]
  72. (hist) ‎Naïve string-search algorithm (Single String Search String Search) ‎[295 bytes]
  73. (hist) ‎Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) ‎[295 bytes]
  74. (hist) ‎Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull) ‎[295 bytes]
  75. (hist) ‎Durstenfeld's Algorithm 235 (General Permutations Generating Random Permutations) ‎[295 bytes]
  76. (hist) ‎Babai & Codenotti (Hypergraphs isomorphism Graph Isomorphism Problem) ‎[295 bytes]
  77. (hist) ‎$O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) ‎[295 bytes]
  78. (hist) ‎Family:4NF Decomposition ‎[296 bytes]
  79. (hist) ‎Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition) ‎[296 bytes]
  80. (hist) ‎Applegate et al. (Approximate TSP The Traveling-Salesman Problem) ‎[296 bytes]
  81. (hist) ‎Robson (3-Graph Coloring Graph Coloring) ‎[296 bytes]
  82. (hist) ‎Kmett (Lowest Common Ancestor with Static Trees Lowest Common Ancestor) ‎[296 bytes]
  83. (hist) ‎Dunning; Gupta & Silberholz (Maximum Cut, Approximate Maximum Cut) ‎[297 bytes]
  84. (hist) ‎Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) ‎[298 bytes]
  85. (hist) ‎Gray-code based (Tower of Hanoi Tower of Hanoi) ‎[298 bytes]
  86. (hist) ‎Johnson's algorithm (Directed, Weighted (Arbitrary weights) All-Pairs Shortest Paths (APSP)) ‎[298 bytes]
  87. (hist) ‎Brute force enumeration (k-Clique k-Clique Problem) ‎[298 bytes]
  88. (hist) ‎Harris and Stephens algorithm ( Corner Detection) ‎[299 bytes]
  89. (hist) ‎Whitted's algorithm 1979 ( Ray Tracing) ‎[299 bytes]
  90. (hist) ‎LÉVY B.; PETITJEAN S.; RAY N.; MAILLOT J 2002 (Mesh Parameterization Mesh Parameterization) ‎[299 bytes]
  91. (hist) ‎BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization) ‎[299 bytes]
  92. (hist) ‎Nested loop join ( Joins) ‎[299 bytes]
  93. (hist) ‎Rayleigh quotient iteration (Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[299 bytes]
  94. (hist) ‎SHA-1 (Unkeyed Hash Functions One-Way Hash Functions) ‎[299 bytes]
  95. (hist) ‎Whirlpool ( One-Way Hash Functions) ‎[299 bytes]
  96. (hist) ‎SHA-2 (Unkeyed Hash Functions One-Way Hash Functions) ‎[299 bytes]
  97. (hist) ‎Exhaustive search (k-OV Orthogonal Vectors) ‎[299 bytes]
  98. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Insertion) ‎[299 bytes]
  99. (hist) ‎Bayer, McCreight B-Tree ( Self-Balancing Trees Deletion) ‎[299 bytes]
  100. (hist) ‎Harris and Stephens algorithm (Corner Detection Feature Detection) ‎[299 bytes]
  101. (hist) ‎Dynamic Programming (Change-Making Problem Change-Making Problem) ‎[300 bytes]
  102. (hist) ‎Lowe (2004) (Corner Detection Feature Detection) ‎[300 bytes]
  103. (hist) ‎Johnson (3-Graph Coloring Graph Coloring) ‎[300 bytes]
  104. (hist) ‎Sort merge join ( Joins) ‎[300 bytes]
  105. (hist) ‎Reduction from UOV to Longest Common Subsequence ‎[300 bytes]
  106. (hist) ‎Family:Median String Problem ‎[301 bytes]
  107. (hist) ‎Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem) ‎[301 bytes]
  108. (hist) ‎Appel's algorithm 1968 ( Ray Tracing) ‎[301 bytes]
  109. (hist) ‎Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Insertion) ‎[301 bytes]
  110. (hist) ‎Guibas, Sedgewick Red-Black Tree ( Self-Balancing Trees Deletion) ‎[301 bytes]
  111. (hist) ‎Alpha-HMM (Matsuyama, Yasuo) (Maximum Likelihood Methods in Unknown Latent Variables, Hidden Markov Models Maximum Likelihood Methods in Unknown Latent Variables) ‎[302 bytes]
  112. (hist) ‎Naive solution ( Cardinality Estimation) ‎[302 bytes]
  113. (hist) ‎BST Algorithm (Duplicate Elimination Duplicate Elimination) ‎[302 bytes]
  114. (hist) ‎LEE Y.; KIM H. S.; LEE S 2002 (Mesh Parameterization Mesh Parameterization) ‎[302 bytes]
  115. (hist) ‎Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis) ‎[303 bytes]
  116. (hist) ‎Kwatra 2003 (Texture Synthesis Texture Synthesis) ‎[303 bytes]
  117. (hist) ‎Wagner-Fischer algorithm (Edit distance, constant-size alphabet Sequence Alignment) ‎[303 bytes]
  118. (hist) ‎Tango Tree ( Self-Balancing Trees Search) ‎[303 bytes]
  119. (hist) ‎Wagner-Fischer algorithm (Edit distance Sequence Alignment) ‎[303 bytes]
  120. (hist) ‎Faaland (Subset Sum The Subset-Sum Problem) ‎[304 bytes]
  121. (hist) ‎W. Eddy Quickhull (2-dimensional Convex Hull) ‎[304 bytes]
  122. (hist) ‎Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) ‎[304 bytes]
  123. (hist) ‎Angelsmark, Jonsson ( ‎[304 bytes]
  124. (hist) ‎Fomin; Gaspers & Saurabh ( ‎[304 bytes]
  125. (hist) ‎Bern; Gilbert; Hendrickson (Inexact Laplacian Solver SDD Systems Solvers) ‎[304 bytes]
  126. (hist) ‎TSPLIB (Minimum TSP The Traveling-Salesman Problem) ‎[304 bytes]
  127. (hist) ‎Euclid's algorithm (Greatest Common Divisor Greatest Common Divisor) ‎[304 bytes]
  128. (hist) ‎Clock (Online Page Replacements) ‎[304 bytes]
  129. (hist) ‎Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search) ‎[305 bytes]
  130. (hist) ‎Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem) ‎[305 bytes]
  131. (hist) ‎5-point Gauss elimination (3-Dimensional Poisson Problem Poisson Problem) ‎[305 bytes]
  132. (hist) ‎Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem) ‎[305 bytes]
  133. (hist) ‎5-point Gauss elimination (2-Dimensional Poisson Problem Poisson Problem) ‎[305 bytes]
  134. (hist) ‎Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search) ‎[305 bytes]
  135. (hist) ‎Image analogies Hertzmann (Texture Synthesis Texture Synthesis) ‎[306 bytes]
  136. (hist) ‎Koivisto ( Chromatic Number) ‎[306 bytes]
  137. (hist) ‎Koivisto ( Chromatic Polynomial) ‎[306 bytes]
  138. (hist) ‎Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem) ‎[306 bytes]
  139. (hist) ‎HybridSpades (Sequence-to-Graph Alignment Sequence-to-Graph Alignment) ‎[306 bytes]
  140. (hist) ‎RIPEMD-160 (Unkeyed Hash Functions One-Way Hash Functions) ‎[306 bytes]
  141. (hist) ‎Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis) ‎[307 bytes]
  142. (hist) ‎R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis) ‎[307 bytes]
  143. (hist) ‎LU Matrix Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  144. (hist) ‎QR Matrix Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  145. (hist) ‎Cholesky Decomposition (Matrix Factorization Collaborative Filtering) ‎[307 bytes]
  146. (hist) ‎Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes)) ‎[307 bytes]
  147. (hist) ‎Reduction from Negative Triangle Detection to Maximum Subarray ‎[307 bytes]
  148. (hist) ‎Schmidt & Druffel ( Graph Isomorphism Problem) ‎[307 bytes]
  149. (hist) ‎Global Newton Method (n player games Nash Equilibria) ‎[307 bytes]
  150. (hist) ‎Trial division (First Category Integer Factoring Integer Factoring) ‎[308 bytes]
  151. (hist) ‎Puterman Modified Policy Iteration (MPI) (Optimal Policies for MDPs Optimal Policies for MDPs) ‎[308 bytes]
  152. (hist) ‎(Boolean Matrix Multiplication (Combinatorial) Matrix Product) ‎[308 bytes]
  153. (hist) ‎Multistep (SCCs Strongly Connected Components) ‎[308 bytes]
  154. (hist) ‎Hierholzer's algorithm (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph) ‎[308 bytes]
  155. (hist) ‎D* Lite ( Informed Search) ‎[308 bytes]
  156. (hist) ‎Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) ‎[309 bytes]
  157. (hist) ‎Random Split Exponential algorithm (Subset Sum The Subset-Sum Problem) ‎[309 bytes]
  158. (hist) ‎Pettie, Ramachandran (Undirected, General MST Minimum Spanning Tree (MST)) ‎[309 bytes]
  159. (hist) ‎Radix sorting method (General Permutations Generating Random Permutations) ‎[309 bytes]
  160. (hist) ‎Fredman-Tarjan (Edmonds-Karp-based) (bipartite (i.e. assignment), general Maximum-weight matching) ‎[309 bytes]
  161. (hist) ‎Wen (2-dimensional Maximum subarray problem) ‎[309 bytes]
  162. (hist) ‎Wen (1-dimensional Maximum subarray problem) ‎[309 bytes]
  163. (hist) ‎Merge Sort (Comparison Sorting Sorting) ‎[310 bytes]
  164. (hist) ‎Quick Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[310 bytes]
  165. (hist) ‎Euler's factorization method (First Category Integer Factoring Integer Factoring) ‎[310 bytes]
  166. (hist) ‎Chen et al ( Maximum Flow) ‎[310 bytes]
  167. (hist) ‎Yao (OBST Optimal Binary Search Trees) ‎[310 bytes]
  168. (hist) ‎Quantum Adiabatic Algorithm (QAA) (CNF-SAT Boolean Satisfiability) ‎[310 bytes]
  169. (hist) ‎Burst Sort (Non-Comparison Sorting Sorting) ‎[311 bytes]
  170. (hist) ‎ZAYER R.; ROESSL C.; SEIDEL H.-P 2005 (Mesh Parameterization Mesh Parameterization) ‎[311 bytes]
  171. (hist) ‎AVL Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  172. (hist) ‎Hopcroft 2-3 Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  173. (hist) ‎Tarjan Splay Tree ( Self-Balancing Trees Creation) ‎[311 bytes]
  174. (hist) ‎Naive solution (The Frequent Words Problem The Frequent Words Problem) ‎[311 bytes]
  175. (hist) ‎Baran, Demaine, Patrascu (Integer 3SUM 3SUM) ‎[311 bytes]
  176. (hist) ‎Shell Sort (Shell) (Comparison Sorting Sorting) ‎[311 bytes]
  177. (hist) ‎Affine scaling ( Linear Programming) ‎[312 bytes]
  178. (hist) ‎Lindeberg (1998) (Corner Detection Feature Detection) ‎[312 bytes]
  179. (hist) ‎FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection) ‎[312 bytes]
  180. (hist) ‎Naive (Longest Palindromic Substring Longest Palindromic Substring) ‎[312 bytes]
  181. (hist) ‎Naive + 1 queen per row restriction (Counting Solutions; Constructing solutions n-Queens Problem) ‎[312 bytes]
  182. (hist) ‎Rabin Karp (The Frequent Words Problem The Frequent Words Problem) ‎[312 bytes]
  183. (hist) ‎Gronlund, Pettie (Real 3SUM 3SUM) ‎[312 bytes]
  184. (hist) ‎Reduction to Abboud, Williams, Yu (k-OV Orthogonal Vectors) ‎[312 bytes]
  185. (hist) ‎Shell Sort (Pratt) (Comparison Sorting Sorting) ‎[312 bytes]
  186. (hist) ‎Naive Algorithm (Counting Solutions; Constructing solutions n-Queens Problem) ‎[313 bytes]
  187. (hist) ‎Shell Sort (Frank & Lazarus) (Comparison Sorting Sorting) ‎[313 bytes]
  188. (hist) ‎Family:Convex Hull ‎[314 bytes]
  189. (hist) ‎Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition) ‎[314 bytes]
  190. (hist) ‎Kruskal's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) ‎[314 bytes]
  191. (hist) ‎LOOK (Disk Scheduling Disk Scheduling) ‎[314 bytes]
  192. (hist) ‎Brand et al ( Maximum Flow) ‎[314 bytes]
  193. (hist) ‎Dynamic Programming (Longest Palindromic Substring Longest Palindromic Substring) ‎[314 bytes]
  194. (hist) ‎Abboud, Williams, Yu (OV Orthogonal Vectors) ‎[314 bytes]
  195. (hist) ‎Family:Eigenvalues (Iterative Methods) ‎[315 bytes]
  196. (hist) ‎Time-Bounded A* (TBA*) (Informed Search Informed Search) ‎[315 bytes]
  197. (hist) ‎Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) ‎[315 bytes]
  198. (hist) ‎Spielman (Isomorphism of strongly regular graphs Graph Isomorphism Problem) ‎[315 bytes]
  199. (hist) ‎Chan (Real 3SUM 3SUM) ‎[315 bytes]
  200. (hist) ‎Reduction to Chan, Williams (k-OV Orthogonal Vectors) ‎[315 bytes]
  201. (hist) ‎Gronlund, Pettie (3-Clique Exact-Weight k-Clique Problem) ‎[315 bytes]
  202. (hist) ‎V. A. Lyul’ka and I. E. Mikhailov 2003 (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[316 bytes]
  203. (hist) ‎Gaussian elimination (2-D Polynomial Interpolation Polynomial Interpolation) ‎[316 bytes]
  204. (hist) ‎WalkSAT (CNF-SAT Boolean Satisfiability) ‎[316 bytes]
  205. (hist) ‎V. A. Lyul’ka and I. E. Mikhailov (Hyperbolic Spline Interpolation Hyperbolic Spline Interpolation) ‎[316 bytes]
  206. (hist) ‎5-point FFT (3-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  207. (hist) ‎9-point FFT (3-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  208. (hist) ‎Cheriton-Tarjan (planar) (Undirected, Planar MST Minimum Spanning Tree (MST)) ‎[317 bytes]
  209. (hist) ‎5-point FFT (2-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  210. (hist) ‎9-point FFT (2-Dimensional Poisson Problem Poisson Problem) ‎[317 bytes]
  211. (hist) ‎Bodlaender (Partial k-trees Graph Isomorphism Problem) ‎[317 bytes]
  212. (hist) ‎Hanoi graph (Tower of Hanoi Tower of Hanoi) ‎[317 bytes]
  213. (hist) ‎Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability) ‎[317 bytes]
  214. (hist) ‎Freund (Real 3SUM 3SUM) ‎[317 bytes]
  215. (hist) ‎Chan, Williams (OV Orthogonal Vectors) ‎[317 bytes]
  216. (hist) ‎Lifelong Planning A* (LPA*) (Informed Search Informed Search) ‎[318 bytes]
  217. (hist) ‎Theta* (Informed Search Informed Search) ‎[318 bytes]
  218. (hist) ‎FLOATER 2003 (Mesh Parameterization Mesh Parameterization) ‎[318 bytes]
  219. (hist) ‎Cheriton-Tarjan (dense) (Undirected, Dense MST Minimum Spanning Tree (MST)) ‎[318 bytes]
  220. (hist) ‎Gabow et al, Section 3 (Directed (Optimum Branchings), General MST Minimum Spanning Tree (MST)) ‎[318 bytes]
  221. (hist) ‎Naïve algorithm ( Variance Calculations) ‎[318 bytes]
  222. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Insertion) ‎[318 bytes]
  223. (hist) ‎Scapegoat Tree ( Self-Balancing Trees Deletion) ‎[318 bytes]
  224. (hist) ‎Family:Geometric Covering Problems ‎[319 bytes]
  225. (hist) ‎Dynamic Programming Algorithm (S. S. Godbole) (Matrix Chain Ordering Problem Matrix Chain Multiplication) ‎[319 bytes]
  226. (hist) ‎Fringe Saving A* (FSA*) (Informed Search Informed Search) ‎[319 bytes]
  227. (hist) ‎Generalized Adaptive A* (GAA*) (Informed Search Informed Search) ‎[319 bytes]
  228. (hist) ‎Brélaz (DSatur) (3-Graph Coloring Graph Coloring) ‎[319 bytes]
  229. (hist) ‎Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) ‎[319 bytes]
  230. (hist) ‎Warnock's algorithm ( Shown Surface Determination) ‎[319 bytes]
  231. (hist) ‎Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection) ‎[319 bytes]
  232. (hist) ‎Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV)) ‎[319 bytes]
  233. (hist) ‎Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations) ‎[319 bytes]
  234. (hist) ‎Gabow et al, Section 2 (Undirected, General MST Minimum Spanning Tree (MST)) ‎[319 bytes]
  235. (hist) ‎Hertli (Modified PPSZ) (3SAT Boolean Satisfiability) ‎[319 bytes]
  236. (hist) ‎Hertli (Modified PPSZ) (4SAT Boolean Satisfiability) ‎[319 bytes]
  237. (hist) ‎Family:Linear System ‎[320 bytes]
  238. (hist) ‎Kruskal’s algorithm with demand-sorting (Undirected, General MST Minimum Spanning Tree (MST)) ‎[320 bytes]
  239. (hist) ‎De ( Multiplication) ‎[320 bytes]
  240. (hist) ‎LOBPCG algorithm (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods)) ‎[320 bytes]
  241. (hist) ‎$O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling) ‎[320 bytes]
  242. (hist) ‎Tamaki, Tokuyama (exact) (2-dimensional Maximum subarray problem) ‎[320 bytes]
  243. (hist) ‎Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis) ‎[321 bytes]
  244. (hist) ‎Linear search (Nearest Neighbor Search (NNS) Nearest Neighbor Search) ‎[321 bytes]
  245. (hist) ‎Briggs; Henson; McCormick ( SDD Systems Solvers) ‎[321 bytes]
  246. (hist) ‎Sattolo's algorithm (Cyclic Permutations Generating Random Permutations) ‎[321 bytes]
  247. (hist) ‎Petro Vlahos Algorithm (Image Compositing Image Compositing) ‎[322 bytes]
  248. (hist) ‎J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection) ‎[322 bytes]
  249. (hist) ‎9-point SOR iteration (3-Dimensional Poisson Problem Poisson Problem) ‎[322 bytes]
  250. (hist) ‎Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV)) ‎[322 bytes]

View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:ShortPages"