Pages with the most categories

Showing below up to 100 results in range #1 to #100.

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

1. Ford–Fulkerson, Python, NetworkX‏‎ (2 categories)
2. Gaussian elimination (finding the LU decomposition)‏‎ (2 categories)
3. Givens method, locality‏‎ (2 categories)
4. Hopcroft–Karp, Java, JGraphT‏‎ (2 categories)
5. Householder (reflections) method for reducing of a matrix to Hessenberg form‏‎ (2 categories)
6. Householder (reflections) reduction of a matrix to bidiagonal form, locality‏‎ (2 categories)
7. K-means clustering, Apache Mahout‏‎ (2 categories)
8. K-means clustering, Octave‏‎ (2 categories)
9. K-means clustering, Stata‏‎ (2 categories)
10. Kaczmarz's, MATLAB1‏‎ (2 categories)
11. Kruskal's algorithm‏‎ (2 categories)
12. Lanczos, C++, MPI, 3‏‎ (2 categories)
13. Longest shortest path, Java, WebGraph‏‎ (2 categories)
14. Methods for solving tridiagonal SLAEs‏‎ (2 categories)
15. Newton's method for systems of nonlinear equations, parallel2‏‎ (2 categories)
16. One step of the dqds, LAPACK‏‎ (2 categories)
17. All Pairs Shortest Path (APSP)‏‎ (2 categories)
18. Pairwise summation of numbers, scalability‏‎ (2 categories)
19. BFS, MPI, Graph500‏‎ (2 categories)
20. Poisson equation, solving with DFT, PFFT‏‎ (2 categories)
21. Backward substitution, scalability‏‎ (2 categories)
22. Prim's, Java, JGraphT‏‎ (2 categories)
23. Bellman-Ford, locality‏‎ (2 categories)
24. QR decomposition of dense nonsingular matrices‏‎ (2 categories)
25. Binary search, C++‏‎ (2 categories)
26. Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix‏‎ (2 categories)
27. Boruvka's, RCC for CPU‏‎ (2 categories)
28. Single Source Shortest Path (SSSP)‏‎ (2 categories)
29. Cholesky decomposition, locality‏‎ (2 categories)
30. Tarjan's biconnected components, C++, Boost Graph Library‏‎ (2 categories)
31. Complete cyclic reduction, scalability‏‎ (2 categories)
32. Tarjan's strongly connected components, Python/C++, NetworKit‏‎ (2 categories)
33. DFS, C++, Boost Graph Library‏‎ (2 categories)
34. The serial-parallel summation method, locality‏‎ (2 categories)
35. Dense matrix multiplication, scalability‏‎ (2 categories)
36. Triangular decompositions‏‎ (2 categories)
37. Dijkstra, Python‏‎ (2 categories)
38. Uniform norm of a vector, locality‏‎ (2 categories)
39. Dot product‏‎ (2 categories)
40. VF2 algorithm‏‎ (2 categories)
41. Finding minimal-cost flow in a transportation network‏‎ (2 categories)
42. Ford–Fulkerson algorithm‏‎ (2 categories)
43. Gaussian elimination with column pivoting‏‎ (2 categories)
44. Hopcroft–Karp algorithm‏‎ (2 categories)
45. Householder (reflections) method for the QR decomposition, SCALAPACK‏‎ (2 categories)
46. Hungarian, Java, JGraphT‏‎ (2 categories)
47. K-means clustering, Ayasdi‏‎ (2 categories)
48. K-means clustering, OpenCV‏‎ (2 categories)
49. K-means clustering, Torch‏‎ (2 categories)
50. Kaczmarz's, MATLAB2‏‎ (2 categories)
51. LU decomposition using Gaussian elimination with pivoting‏‎ (2 categories)
52. Lanczos, C, MPI‏‎ (2 categories)
53. Longest shortest path, Python/C++, NetworKit‏‎ (2 categories)
54. Newton's method for systems of nonlinear equations‏‎ (2 categories)
55. Newton's method for systems of nonlinear equations, parallel3‏‎ (2 categories)
56. One step of the dqds algorithm‏‎ (2 categories)
57. Assignment problem‏‎ (2 categories)
58. Parallel prefix scan algorithm using pairwise summation‏‎ (2 categories)
59. BFS, Python, NetworkX‏‎ (2 categories)
60. Poisson equation, solving with DFT, cuFFT‏‎ (2 categories)
61. Bellman-Ford, C++, Boost Graph Library‏‎ (2 categories)
62. Prim's algorithm‏‎ (2 categories)
63. Bellman-Ford, scalability‏‎ (2 categories)
64. Reducing matrices to compact forms‏‎ (2 categories)
65. Binary search, Java‏‎ (2 categories)
66. Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions‏‎ (2 categories)
67. Boruvka's, RCC for GPU‏‎ (2 categories)
68. Singular value decomposition (finding singular values and singular vectors)‏‎ (2 categories)
69. Cholesky decomposition, scalability‏‎ (2 categories)
70. Tarjan's biconnected components, Java, JGraphT‏‎ (2 categories)
71. Construction of the minimum spanning tree (MST)‏‎ (2 categories)
72. Tarjan's strongly connected components algorithm‏‎ (2 categories)
73. DFS, C++, MPI, Parallel Boost Graph Library‏‎ (2 categories)
74. The serial-parallel summation method, scalability‏‎ (2 categories)
75. Dense matrix multiplication (serial version for real matrices)‏‎ (2 categories)
76. Two-qubit transform of a state vector‏‎ (2 categories)
77. Dijkstra, Python/C++‏‎ (2 categories)
78. Uniform norm of a vector: Real version, serial-parallel variant‏‎ (2 categories)
79. Dot product, locality‏‎ (2 categories)
80. Vertex connectivity of a graph‏‎ (2 categories)
81. Floyd-Warshall, C++, Boost Graph Library‏‎ (2 categories)
82. Forward substitution‏‎ (2 categories)
83. Gaussian elimination with complete pivoting‏‎ (2 categories)
84. Graph connectivity‏‎ (2 categories)
85. Horners, locality‏‎ (2 categories)
86. Householder (reflections) method for the QR decomposition, locality‏‎ (2 categories)
87. Hungarian algorithm‏‎ (2 categories)
88. K-means clustering, CrimeStat‏‎ (2 categories)
89. K-means clustering, R‏‎ (2 categories)
90. K-means clustering, Weka‏‎ (2 categories)
91. Kaczmarz's, MATLAB3‏‎ (2 categories)
92. LU decomposition using Gaussian elimination without pivoting‏‎ (2 categories)
93. Lanczos, MPI, OpenMP‏‎ (2 categories)
94. Matrix decomposition problem‏‎ (2 categories)
95. Newton's method for systems of nonlinear equations, ALIAS C++‏‎ (2 categories)
96. Newton's method for systems of nonlinear equations, scalability1‏‎ (2 categories)
97. Orthogonalization method‏‎ (2 categories)
98. Auction algorithm‏‎ (2 categories)
99. Poisson equation, solving with DFT‏‎ (2 categories)
100. BFS, Python/C++, NetworKit‏‎ (2 categories)

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