Short pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #151 to #200.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- (hist) Jacobi (rotations) method for finding singular values [208 bytes]
- (hist) Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix [215 bytes]
- (hist) Serial Jacobi (rotations) method with thresholds for symmetric matrices [220 bytes]
- (hist) The classical Jacobi (rotations) method with pivoting for symmetric matrices [221 bytes]
- (hist) Uniform norm of a vector: Real version, serial-parallel variant [223 bytes]
- (hist) Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) [230 bytes]
- (hist) Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version [236 bytes]
- (hist) Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions [269 bytes]
- (hist) Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form [275 bytes]
- (hist) Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form [275 bytes]
- (hist) Help [379 bytes]
- (hist) Unitary-triangular factorizations [527 bytes]
- (hist) K-means clustering, Stata [579 bytes]
- (hist) K-means clustering, SAS [590 bytes]
- (hist) K-means clustering, Mathematica [605 bytes]
- (hist) BFS, GAP [608 bytes]
- (hist) BFS, RCC for CPU [615 bytes]
- (hist) K-means clustering, MATLAB [616 bytes]
- (hist) K-means clustering, RapidMiner [621 bytes]
- (hist) BFS, MPI, Graph500 [624 bytes]
- (hist) LU decomposition using Gaussian elimination without pivoting [625 bytes]
- (hist) Boruvka's, RCC for GPU [625 bytes]
- (hist) K-means clustering, Ayasdi [635 bytes]
- (hist) BFS, RCC for GPU [637 bytes]
- (hist) BFS, Ligra [642 bytes]
- (hist) VF2, C++, VF Library [669 bytes]
- (hist) K-means clustering, SAP HANA [674 bytes]
- (hist) Boruvka's, RCC for CPU [677 bytes]
- (hist) QR decomposition methods for dense Hessenberg matrices [687 bytes]
- (hist) Δ-stepping, Gap [698 bytes]
- (hist) Cooley-Tukey, scalability [701 bytes]
- (hist) Bellman-Ford, Ligra [703 bytes]
- (hist) Bellman-Ford, MPI, Graph500 [705 bytes]
- (hist) Bellman-Ford, OpenMP, Stinger [712 bytes]
- (hist) Bellman-Ford, Nvidia nvGraph [719 bytes]
- (hist) Ullman's, C++, VF Library [723 bytes]
- (hist) HITS, VGL [726 bytes]
- (hist) PageRank, VGL [731 bytes]
- (hist) Disjoint set union, Java, JGraphT [741 bytes]
- (hist) BFS, VGL [743 bytes]
- (hist) Prim's, Java, JGraphT [752 bytes]
- (hist) VF2, Python, NetworkX [754 bytes]
- (hist) BFS, Python/C++, NetworKit [757 bytes]
- (hist) Bellman-Ford, Java, JGraphT [758 bytes]
- (hist) BFS, C++, MPI, Boost Graph Library [761 bytes]
- (hist) Kruskal's, Java, JGraphT [761 bytes]
- (hist) Floyd-Warshall, Java, JGraphT [765 bytes]
- (hist) Ullman's, C++, Chemical Descriptors Library [767 bytes]
- (hist) BFS, Java, WebGraph [772 bytes]
- (hist) BFS, Python, NetworkX [773 bytes]