Pages with the most revisions

Jump to navigation Jump to search

Showing below up to 50 results in range #751 to #800.

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

  1. Bowyer–Watson algorithm (2-Dimensional Delaunay Triangulation Delaunay Triangulation)‏‎ (2 revisions)
  2. Domain:Combinatorics‏‎ (2 revisions)
  3. EKF SLAM (SLAM Algorithms SLAM Algorithms)‏‎ (2 revisions)
  4. Yavne Split Radix FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)‏‎ (2 revisions)
  5. Brute force (backtracking search) (The Vertex Cover Problem The Vertex Cover Problem)‏‎ (2 revisions)
  6. Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (2 revisions)
  7. 1-sensitive decremental st-shortest paths‏‎ (2 revisions)
  8. ADI Iteration‏‎ (2 revisions)
  9. St-Shortest Path‏‎ (2 revisions)
  10. UKF (SLAM Algorithms SLAM Algorithms)‏‎ (2 revisions)
  11. Brélaz (DSatur) (3-Graph Coloring Graph Coloring)‏‎ (2 revisions)
  12. Digital Differential Analyzer (Line Drawing Line Drawing)‏‎ (2 revisions)
  13. Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs))‏‎ (2 revisions)
  14. Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)‏‎ (2 revisions)
  15. Brute-force search (3-Graph Coloring Graph Coloring)‏‎ (2 revisions)
  16. Xiaolin Wu's line algorithm (Line Drawing Line Drawing)‏‎ (2 revisions)
  17. Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems)‏‎ (2 revisions)
  18. AVL Tree ( Self-Balancing Trees Creation)‏‎ (2 revisions)
  19. Brute Force (1D Maximum Subarray Maximum Subarray Problem)‏‎ (2 revisions)
  20. Ellipsoid method (General, Constrained optimization Convex Optimization (Non-linear))‏‎ (2 revisions)
  21. Sleator & Tarjan ( Maximum Flow)‏‎ (2 revisions)
  22. Y. Dufournaud; C. Schmid; and R. Horaud 2000 (Blob Detection Feature Detection)‏‎ (2 revisions)
  23. Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs))‏‎ (2 revisions)
  24. YANG Y.; KIM J.; LUO F.; HU S.; GU X. 2008 (Mesh Parameterization Mesh Parameterization)‏‎ (2 revisions)
  25. Edmonds & Karp ( Maximum Flow)‏‎ (2 revisions)
  26. Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs))‏‎ (2 revisions)
  27. Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs))‏‎ (2 revisions)
  28. Srba (SLAM Algorithms SLAM Algorithms)‏‎ (2 revisions)
  29. Dinitz (with dynamic trees) ( Maximum Flow)‏‎ (2 revisions)
  30. Dinur & Steurer ( The Set-Covering Problem)‏‎ (2 revisions)
  31. Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (2 revisions)
  32. Trial division (First Category Integer Factoring Integer Factoring)‏‎ (2 revisions)
  33. Boissonnat; Snoeyink (Reporting all intersection points, generalized segments Line segment intersection)‏‎ (2 revisions)
  34. Two-pass algorithm ( Variance Calculations)‏‎ (2 revisions)
  35. Brute force algorithm (Functional Dependency Inference Problem Dependency Inference Problem)‏‎ (2 revisions)
  36. EM with Quasi-Newton Methods (Jamshidian; Mortaza; Jennrich; Robert I.) (Maximum Likelihood Methods in Unknown Latent Variables Maximum Likelihood Methods in Unknown Latent Variables)‏‎ (2 revisions)
  37. A* Algorithm‏‎ (2 revisions)
  38. Bringman (Subset Sum The Subset-Sum Problem)‏‎ (2 revisions)
  39. Boolean d-Attribute Stable Matching‏‎ (2 revisions)
  40. Yao's algorithm (Undirected, General MST Minimum Spanning Tree (MST))‏‎ (2 revisions)
  41. 1-sensitive (3/2)-approximate ss-shortest paths‏‎ (2 revisions)
  42. A* Informed Search‏‎ (2 revisions)
  43. Divide-and-conquer (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))‏‎ (2 revisions)
  44. Distinct-degree factorization (Distinct-degree Factorization of Polynomials Over Finite Fields)‏‎ (2 revisions)
  45. Spreadsort (Non-Comparison Sorting Sorting)‏‎ (2 revisions)
  46. Disjunctive coBüchi Objectives‏‎ (2 revisions)
  47. Boman; Chen; Hendrickson; Toledo (Inexact Laplacian Solver SDD Systems Solvers)‏‎ (2 revisions)
  48. Zhao-Saalfeld ( Line Simplification)‏‎ (2 revisions)
  49. Reduction from 3SUM to 3SUM'‏‎ (1 revision)
  50. Ravikumar & Cohen Generative Models (Entity Resolution Entity Resolution)‏‎ (1 revision)

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