<p>Numbers are the run time (in seconds, s, or minutes, m) of HDAT, using parallel computation in R, under different numbers of subjects, SNPs, and permutations.</p
<p>Computation time of the OSEM algorithm (in seconds) and speedup by the GPU implementation based o...
<p>Comparison of running time (seconds) of the algorithms implemented in MATLAB (upper section) and ...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the SRBCT da...
<p>The iteration number and running time with different <i>D</i> and <i>S</i>.</p
Computational time comparison of five methods on blocks drawn from six data sets (seconds).</p
<p>The number of iterations = 400. Text in bold indicates the best performance for a specific image....
<p>Computation time (in seconds) for several implementations of the evaluated clustering algorithms ...
<p>The dependence of the mean time of the algorithm execution from the total number of residues in t...
<p>Computation time (in seconds) for several implementations of the evaluated clustering algorithms ...
<p>Running time (in CPU seconds) of different methods in digital Moby phantom studies.</p
Shows the mean operation time of each algorithm on Oxford dataset in units of seconds.</p
<p>The results of a parallel analysis with 1,000 iterations of the IA and HI subscales.</p
<p>The computation times (unit in second) averaging over scenarios having with the same numbers of c...
Parallel efficiency comparison in the algorithm in this paper and DP K-means.</p
<p>The execution time of the three methods against different numbers of new data points.</p
<p>Computation time of the OSEM algorithm (in seconds) and speedup by the GPU implementation based o...
<p>Comparison of running time (seconds) of the algorithms implemented in MATLAB (upper section) and ...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the SRBCT da...
<p>The iteration number and running time with different <i>D</i> and <i>S</i>.</p
Computational time comparison of five methods on blocks drawn from six data sets (seconds).</p
<p>The number of iterations = 400. Text in bold indicates the best performance for a specific image....
<p>Computation time (in seconds) for several implementations of the evaluated clustering algorithms ...
<p>The dependence of the mean time of the algorithm execution from the total number of residues in t...
<p>Computation time (in seconds) for several implementations of the evaluated clustering algorithms ...
<p>Running time (in CPU seconds) of different methods in digital Moby phantom studies.</p
Shows the mean operation time of each algorithm on Oxford dataset in units of seconds.</p
<p>The results of a parallel analysis with 1,000 iterations of the IA and HI subscales.</p
<p>The computation times (unit in second) averaging over scenarios having with the same numbers of c...
Parallel efficiency comparison in the algorithm in this paper and DP K-means.</p
<p>The execution time of the three methods against different numbers of new data points.</p
<p>Computation time of the OSEM algorithm (in seconds) and speedup by the GPU implementation based o...
<p>Comparison of running time (seconds) of the algorithms implemented in MATLAB (upper section) and ...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the SRBCT da...
DOI
Add to ORKG