Oldest 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. Image Compositing‏‎ (11:25, 15 February 2023)
  2. Diffuse Reflection‏‎ (11:25, 15 February 2023)
  3. Mesh Simplification‏‎ (11:25, 15 February 2023)
  4. POMDPs‏‎ (11:25, 15 February 2023)
  5. Rasterization‏‎ (11:25, 15 February 2023)
  6. Environment Mapping‏‎ (11:25, 15 February 2023)
  7. Occupancy Grid Mapping‏‎ (11:25, 15 February 2023)
  8. Fredholm Equations‏‎ (11:26, 15 February 2023)
  9. Volterra Equations‏‎ (11:26, 15 February 2023)
  10. Steal/No-Force‏‎ (11:26, 15 February 2023)
  11. No-Steal/Force‏‎ (11:26, 15 February 2023)
  12. Chromatic Polynomial‏‎ (11:27, 15 February 2023)
  13. Maximum Inner Product Search‏‎ (11:30, 15 February 2023)
  14. Approximate Hard-Margin SVM‏‎ (11:30, 15 February 2023)
  15. Exponential Time Hypothesis (ETH)‏‎ (11:30, 15 February 2023)
  16. Strong Exponential Time Hypothesis (SETH)‏‎ (11:30, 15 February 2023)
  17. Orthogonal Vectors Hypothesis (OVH)‏‎ (11:30, 15 February 2023)
  18. Unbalanced Orthogonal Vectors Hypothesis (UOVH)‏‎ (11:30, 15 February 2023)
  19. K-OV Hypothesis‏‎ (11:30, 15 February 2023)
  20. K-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  21. 3SUM Hypothesis (3-SUM Hypothesis)‏‎ (11:30, 15 February 2023)
  22. All Pairs Shortest Paths Hypothesis (APSP Hypothesis)‏‎ (11:30, 15 February 2023)
  23. Hitting Set Hypothesis (HS Hypothesis)‏‎ (11:30, 15 February 2023)
  24. Min-Weight k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  25. Exact k-Clique Hypothesis‏‎ (11:30, 15 February 2023)
  26. Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)‏‎ (11:30, 15 February 2023)
  27. Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis)‏‎ (11:30, 15 February 2023)
  28. Nondeterministic Strong Exponential Time Hypothesis (NSETH)‏‎ (11:30, 15 February 2023)
  29. More Believable Exponential Time Hypothesis (MBETH)‏‎ (11:30, 15 February 2023)
  30. Strong Triangle Conjecture‏‎ (11:30, 15 February 2023)
  31. $\delta$-Triangle Conjecture‏‎ (11:31, 15 February 2023)
  32. Parametrized Inapproximability Hypothesis (PIH)‏‎ (11:31, 15 February 2023)
  33. Weak Parametrized Inapproximability Hypothesis (WPIH)‏‎ (11:31, 15 February 2023)
  34. Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  35. Karpinski (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  36. Klawe; Mumey (Alphabetic Tree Problem Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  37. Larmore (Approximate OBST Optimal Binary Search Trees)‏‎ (11:31, 15 February 2023)
  38. Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  39. Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  40. 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)
  41. Compression/Clustering (Vector Quantization) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)‏‎ (11:31, 15 February 2023)
  42. Pisinger (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  43. Faaland (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  44. Pferschy (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  45. Klinz (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  46. Epstein (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  47. Lokshtanov (Subset Sum The Subset-Sum Problem)‏‎ (11:31, 15 February 2023)
  48. Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem)‏‎ (11:31, 15 February 2023)
  49. Lawrence, Reilly (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  50. Lawrence Gibbs Sampling (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  51. MotifSampler (Motif Search Motif Search)‏‎ (11:31, 15 February 2023)
  52. Tree-structured vector quantization Wei-Levoy (Texture Synthesis Texture Synthesis)‏‎ (11:31, 15 February 2023)
  53. Spatial GAN-Based; Urs Bergmann, Nikolay Jetchev, Roland Vollgraf (Texture Synthesis Texture Synthesis)‏‎ (11:31, 15 February 2023)
  54. Grigoryan (n-Queens Completion n-Queens Problem)‏‎ (11:31, 15 February 2023)
  55. Sedgewick; Szymanski; and Yao ( Cycle Detection)‏‎ (11:31, 15 February 2023)
  56. Nivasch ( Cycle Detection)‏‎ (11:31, 15 February 2023)
  57. Counting Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  58. Bucket Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  59. Radix Sort (Non-Comparison Sorting Sorting)‏‎ (11:31, 15 February 2023)
  60. Ford & Fulkerson ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  61. Dinitz ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  62. Karzanov ( Maximum Flow)‏‎ (11:32, 15 February 2023)
  63. Naive algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  64. Pan's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  65. Romani's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  66. Vassilevska Williams (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  67. François Le Gall (Matrix Multiplication Matrix Product)‏‎ (11:32, 15 February 2023)
  68. Brute force (4-Graph Coloring Graph Coloring)‏‎ (11:32, 15 February 2023)
  69. 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)
  70. Cholesky (Positive Definite, Hermitian Matrix Linear System)‏‎ (11:32, 15 February 2023)
  71. Aasen's method (Non-Definite, Symmetric Matrix Linear System)‏‎ (11:32, 15 February 2023)
  72. Levinson–Durbin recursion (Toeplitz Matrix Linear System)‏‎ (11:32, 15 February 2023)
  73. Bareiss Algorithm (Toeplitz Matrix Linear System)‏‎ (11:32, 15 February 2023)
  74. Bjorck-Pereyra (Vandermonde Matrix Linear System)‏‎ (11:32, 15 February 2023)
  75. Brute Force (2-dimensional Convex Hull)‏‎ (11:32, 15 February 2023)
  76. Doolittle Algorithm (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  77. Crout and LUP algorithms (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  78. Okunev; Johnson (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:32, 15 February 2023)
  79. A* Algorithm (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  80. Bidirectional A* Algorithm (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  81. Fringe Saving A* (FSA*) (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  82. Generalized Adaptive A* (GAA*) (Informed Search Informed Search)‏‎ (11:32, 15 February 2023)
  83. Iterative Deepening A* (IDA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  84. Jump Point Search (JPS) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  85. Lifelong Planning A* (LPA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  86. Simplified Memory-Bounded A* (SMA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  87. Theta* (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  88. Anytime Repairing A* (ARA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  89. Time-Bounded A* (TBA*) (Informed Search Informed Search)‏‎ (11:33, 15 February 2023)
  90. Naïve string-search algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  91. Boyer-Moore (BM) algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  92. Rabin-Karp (RK) algorithm (Single String Search String Search)‏‎ (11:33, 15 February 2023)
  93. Needleman–Wunsch algorithm (Edit sequence, global alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  94. Smith–Waterman algorithm (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  95. Masek; Patterson (Edit distance, constant-size alphabet Sequence Alignment)‏‎ (11:33, 15 February 2023)
  96. Hirschberg's algorithm (Edit sequence, constant-size alphabet Sequence Alignment)‏‎ (11:33, 15 February 2023)
  97. FASTA (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  98. Gotoh (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  99. Altschul and Erickson (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  100. Myers and Miller (Edit sequence, local alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  101. David Sankoff (Edit sequence, global alignment Sequence Alignment)‏‎ (11:33, 15 February 2023)
  102. Rabin–Scott powerset construction ( NFA to DFA conversion)‏‎ (11:33, 15 February 2023)
  103. Grenander (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:34, 15 February 2023)
  104. Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:34, 15 February 2023)
  105. Speller (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  106. Mitra (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  107. Census (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  108. Risotto (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  109. PMS (Motif Search Motif Search)‏‎ (11:34, 15 February 2023)
  110. Brute Force (Rod-Cutting Problem Rod-Cutting Problem)‏‎ (11:34, 15 February 2023)
  111. Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem)‏‎ (11:34, 15 February 2023)
  112. Brute Force (Change-Making Problem Change-Making Problem)‏‎ (11:34, 15 February 2023)
  113. Dynamic Programming (Change-Making Problem Change-Making Problem)‏‎ (11:34, 15 February 2023)
  114. Chandra (Approximate MCOP Matrix Chain Multiplication)‏‎ (11:34, 15 February 2023)
  115. Chin (Approximate MCOP Matrix Chain Multiplication)‏‎ (11:34, 15 February 2023)
  116. Bini's algorithm (Matrix Multiplication Matrix Product)‏‎ (11:34, 15 February 2023)
  117. Karger, Blum ( Graph Coloring)‏‎ (11:34, 15 February 2023)
  118. Miller-Tucker-Zemlin (MTZ) formulation (Minimum TSP The Traveling-Salesman Problem)‏‎ (11:34, 15 February 2023)
  119. Dantzig-Fulkerson-Johnson (DFJ) formulation (Minimum TSP The Traveling-Salesman Problem)‏‎ (11:34, 15 February 2023)
  120. Harris and Stephens algorithm ( Corner Detection)‏‎ (11:34, 15 February 2023)
  121. L. Kitchen and A. Rosenfeld (Grey-scale Corner Detection)‏‎ (11:35, 15 February 2023)
  122. The SUSAN corner detector ( Corner Detection)‏‎ (11:35, 15 February 2023)
  123. Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem)‏‎ (11:35, 15 February 2023)
  124. Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)‏‎ (11:35, 15 February 2023)
  125. Roth AlignACE (Motif Search Motif Search)‏‎ (11:35, 15 February 2023)
  126. Petro Vlahos Algorithm (Image Compositing Image Compositing)‏‎ (11:35, 15 February 2023)
  127. Non-parametric sampling Efros and Leung (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  128. R. Paget ; I.D. Longstaff (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  129. Image quilting Efros-Freeman (Texture Synthesis Texture Synthesis)‏‎ (11:35, 15 February 2023)
  130. Fomin; Gaspers & Saurabh (4-Graph Coloring Graph Coloring)‏‎ (11:35, 15 February 2023)
  131. Khuller; Matias Randomized Sieve ( Closest Pair Problem)‏‎ (11:35, 15 February 2023)
  132. Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)‏‎ (11:35, 15 February 2023)
  133. Bitap algorithm (Single String Search String Search)‏‎ (11:35, 15 February 2023)
  134. Tim Sort (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  135. Cube Sort Parallel Implementation (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  136. Shell Sort; (Shell) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  137. Shell Sort; (Frank & Lazarus) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  138. Shell Sort; (Pratt) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  139. Shell Sort; (Sedgewick) (Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  140. Bead Sort (Non-Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  141. Burst Sort (Non-Comparison Sorting Sorting)‏‎ (11:35, 15 February 2023)
  142. Hashing (kth Order Statistic kth Order Statistic)‏‎ (11:35, 15 February 2023)
  143. Hunt and Szymanski (LCS Longest Common Subsequence)‏‎ (11:35, 15 February 2023)
  144. Mukhopadhyay (LCS Longest Common Subsequence)‏‎ (11:35, 15 February 2023)
  145. Cherkassky ( Maximum Flow)‏‎ (11:35, 15 February 2023)
  146. James B Orlin's + KRT (King; Rao; Tarjan)'s algorithm (st-Maximum Flow Maximum Flow)‏‎ (11:36, 15 February 2023)
  147. Schiermeyer (3-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  148. Lawler (4-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  149. Byskov (4-Graph Coloring Graph Coloring)‏‎ (11:36, 15 February 2023)
  150. Conjugate Gradient (Approximation? with positive definite matrix Linear System)‏‎ (11:36, 15 February 2023)
  151. Karmarkar's algorithm ( Linear Programming)‏‎ (11:36, 15 February 2023)
  152. Affine scaling ( Linear Programming)‏‎ (11:36, 15 February 2023)
  153. CHAZELLE (Reporting all intersection points, line segments Line segment intersection)‏‎ (11:36, 15 February 2023)
  154. W. Eddy Quickhull (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  155. Andrew's algorithm (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  156. The ultimate planar convex hull algorithm (2-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  157. Chan's algorithm (2-dimensional; 3-dimensional Convex Hull)‏‎ (11:36, 15 February 2023)
  158. Kosaraju's algorithm (SCCs Strongly Connected Components)‏‎ (11:36, 15 February 2023)
  159. Tarjan's strongly connected components algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  160. Path-based strong components algorithm; Dijkstra (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  161. Pearce (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  162. Path-based depth-first search Gabow (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  163. Paul Purdom (Transitive Closure Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  164. Lowe’s Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  165. Renault’s Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  166. Couvreur (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  167. OBF Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  168. CH Algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  169. Hong’s algorithm (SCCs Strongly Connected Components)‏‎ (11:37, 15 February 2023)
  170. Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (11:37, 15 February 2023)
  171. Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem)‏‎ (11:37, 15 February 2023)
  172. Dyer (2-dimensional array representation Closest Pair Problem)‏‎ (11:37, 15 February 2023)
  173. Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))‏‎ (11:37, 15 February 2023)
  174. Dixon's algorithm (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  175. Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  176. Quadratic sieve (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  177. Rational sieve (Second Category Integer Factoring Integer Factoring)‏‎ (11:38, 15 February 2023)
  178. Closed formula ( LU Decomposition)‏‎ (11:38, 15 February 2023)
  179. Randomized LU Decomposition (Rectangular Matrix LU Decomposition LU Decomposition)‏‎ (11:38, 15 February 2023)
  180. David ( LU Decomposition)‏‎ (11:38, 15 February 2023)
  181. Greedy Best-First Search (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  182. Incremental Heuristic Search ( Informed Search)‏‎ (11:38, 15 February 2023)
  183. Block A* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  184. D* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  185. Field D* (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  186. Fringe (Informed Search Informed Search)‏‎ (11:38, 15 February 2023)
  187. Tuned Boyer-Moore algorithm (Single String Search String Search)‏‎ (11:38, 15 February 2023)
  188. FOGSAA (Edit sequence, global alignment Sequence Alignment)‏‎ (11:38, 15 February 2023)
  189. Skala (convex and non-convex polyhedral window Line Clipping)‏‎ (11:38, 15 February 2023)
  190. Lamport's bakery algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  191. Szymanski's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  192. Taubenfeld's black-white bakery algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  193. Maekawa's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  194. Suzuki-Kasami's algorithm ( Mutual Exclusion)‏‎ (11:39, 15 February 2023)
  195. Painter's algorithm/Newell's algorithm ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  196. Warnock's algorithm ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  197. Ray tracing ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  198. Binary space partitioning (BSP) ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  199. Z-buffering ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  200. S-buffer/Scanline Rendering ( Shown Surface Determination)‏‎ (11:39, 15 February 2023)
  201. Power Iteration (Eigenpair with the Largest Eigenvalue Eigenvalues (Iterative Methods))‏‎ (11:39, 15 February 2023)
  202. Fortune ( Delaunay triangulation)‏‎ (11:39, 15 February 2023)
  203. Gries (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:39, 15 February 2023)
  204. Bird (1D Maximum Subarray Maximum Subarray Problem)‏‎ (11:39, 15 February 2023)
  205. Resource hierarchy solution (Dining Philosophers Problem Deadlock Avoidance)‏‎ (11:39, 15 February 2023)
  206. Arbitrator solution (Dining Philosophers Problem Deadlock Avoidance)‏‎ (11:39, 15 February 2023)
  207. Applegate et al. (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  208. Johnson; D. S.; McGeoch; L. A. ( The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  209. Gutina; Gregory; Yeob; Anders; Zverovich; Alexey ( The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  210. Rosenkrantz; D. J.; Stearns; R. E.; Lewis; P. M. (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  211. Lin–Kernighan (Approximate TSP The Traveling-Salesman Problem)‏‎ (11:39, 15 February 2023)
  212. Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:39, 15 February 2023)
  213. Greedy SEQAID (De Novo Genome Assembly De Novo Genome Assembly)‏‎ (11:39, 15 February 2023)
  214. Dürer rendering algorithm ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  215. Appel's algorithm 1968 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  216. Whitted's algorithm 1979 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  217. J.-C. Nebel 1998 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  218. A. Chalmers; T. Davis; and E. Reinhard 2002 ( Ray Tracing)‏‎ (11:39, 15 February 2023)
  219. Moravec's algorithm 1980 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  220. J. J. Koenderink and W. Richards 1988 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  221. Lindeberg (1994) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  222. Lindeberg (1998) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  223. K. Mikolajczyk; K. and C. Schmid LoG 2004 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  224. Lowe (2004) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  225. T. Lindeberg and J. Garding (1997) (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  226. Lindeberg 2005 (Corner Detection Feature Detection)‏‎ (11:39, 15 February 2023)
  227. The Wang and Brady corner detection algorithm 1995 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  228. The Trajkovic and Hedley corner detector 1998 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  229. FAST E. Rosten and T. Drummond 2006 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  230. Trujillo and Olague 2008 (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  231. Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  232. Tao Luo, Zaifeng Shi and Pumeng Wang (Corner Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  233. T. Lindeberg DoG 2012 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  234. SIFT Algorithm Lowe 2004 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  235. Hessain Determinant Lindeberg 1994 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  236. Hessain Determinant Lindeberg 1998 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  237. SURF Descriptor 2006 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  238. Hessian-Laplace Mikolajczyk and Schmid 2004 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  239. Spatio-temporal Geert Willems; Tinne Tuytelaars and Luc van Gool (2008) (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  240. Lindeberg's watershed-based grey-level blob detection algorithm 1991 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  241. Maximally stable extremal regions Matas 2002 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  242. A. Baumberg. 2000 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  243. Local scale-invariant Lowe 1999 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  244. T. Tuytelaars and L. Van Gool 2000 (Blob Detection Feature Detection)‏‎ (11:40, 15 February 2023)
  245. View frustum culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  246. Sector-Based Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  247. Occlusion Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  248. Contribution Culling (Culling Culling)‏‎ (11:40, 15 February 2023)
  249. Kwatra 2003 (Texture Synthesis Texture Synthesis)‏‎ (11:40, 15 February 2023)
  250. CNN Based Gatys; Leon A 2001 (Texture Synthesis Texture Synthesis)‏‎ (11:40, 15 February 2023)

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

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