Pages with the fewest revisions

Jump to navigation Jump to search

Showing below up to 50 results in range #121 to #170.

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

  1. Classical orthogonalization method‏‎ (1 revision)
  2. Tarjan's biconnected components algorithm‏‎ (1 revision)
  3. Lanczos algorithm in exact algorithm (without reorthogonalization)‏‎ (1 revision)
  4. Serial Jacobi (rotations) method with thresholds for symmetric matrices‏‎ (1 revision)
  5. K-means clustering, RapidMiner‏‎ (1 revision)
  6. Bellman-Ford, Nvidia nvGraph‏‎ (1 revision)
  7. VF2, C++, Boost Graph Library‏‎ (1 revision)
  8. Tarjan's strongly connected components, Java, WebGraph‏‎ (1 revision)
  9. Tarjan's strongly connected components, Python, NetworkX‏‎ (1 revision)
  10. Boruvka's, C++, MPI, Parallel Boost Graph Library‏‎ (1 revision)
  11. Lanczos, C++, MPI‏‎ (1 revision)
  12. The serial-parallel summation method, locality‏‎ (1 revision)
  13. Binary search, Python‏‎ (1 revision)
  14. Single-qubit transform of a state vector, scalability‏‎ (1 revision)
  15. Prim's algorithm‏‎ (1 revision)
  16. Auction algorithm‏‎ (1 revision)
  17. Meet-in-the-middle attack, implementation2‏‎ (1 revision)
  18. High Performance Conjugate Gradient (HPCG) benchmark‏‎ (1 revision)
  19. Two-sided Thomas algorithm, block variant‏‎ (1 revision)
  20. Reducing matrices to compact forms‏‎ (1 revision)
  21. Gaussian elimination with column pivoting‏‎ (1 revision)
  22. The classical Jacobi (rotations) method with pivoting for symmetric matrices‏‎ (1 revision)
  23. BFS, MPI, Graph500‏‎ (1 revision)
  24. Ullman's, C++, VF Library‏‎ (1 revision)
  25. Hopcroft–Karp, Java, JGraphT‏‎ (1 revision)
  26. Kruskal's, Python, NetworkX‏‎ (1 revision)
  27. Tarjan's strongly connected components, Python/C++, NetworKit‏‎ (1 revision)
  28. Dijkstra, C++, MPI: Parallel Boost Graph Library, 2‏‎ (1 revision)
  29. HPCG, scalability‏‎ (1 revision)
  30. Dense matrix multiplication, scalability‏‎ (1 revision)
  31. K-means clustering, R‏‎ (1 revision)
  32. Horners, locality‏‎ (1 revision)
  33. K-means clustering, CrimeStat‏‎ (1 revision)
  34. Dijkstra, Google‏‎ (1 revision)
  35. Face recognition‏‎ (1 revision)
  36. Meet-in-the-middle attack, implementation3‏‎ (1 revision)
  37. Newton's method for systems of nonlinear equations, PETSc‏‎ (1 revision)
  38. Householder (reflections) method for the QR decomposition, locality‏‎ (1 revision)
  39. Numerical quadrature (cubature) rules on an interval (for a multidimensional cube), scalability‏‎ (1 revision)
  40. Uniform norm of a vector: Real version, serial-parallel variant‏‎ (1 revision)
  41. HITS, VGL‏‎ (1 revision)
  42. Tarjan's biconnected components, Java, JGraphT‏‎ (1 revision)
  43. Preflow-Push, C++, Boost Graph Library‏‎ (1 revision)
  44. Poisson equation, solving with DFT, cuFFT‏‎ (1 revision)
  45. Binary search, С‏‎ (1 revision)
  46. The serial-parallel summation method, scalability‏‎ (1 revision)
  47. Boruvka's, scalability‏‎ (1 revision)
  48. Face recognition, scalability‏‎ (1 revision)
  49. Binary search, .NET Framework 2.0‏‎ (1 revision)
  50. Triangular decompositions‏‎ (1 revision)

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