<p>Each point is the average of 10 runs, with the error bars denoting the standard error on the mean. The horizontal dashed line shows the result for the full BHC method.</p
The evaluation metrics computed from best result of the BHCNet-3 in each magnification factor and co...
<p>Each data point is obtained by averaging over ten runs, each of which has an independently random...
<p>The horizontal dashed line indicates the average value of for parameter estimates using the true...
<p>Each point is the average of 10 runs, with the error bars denoting the standard error on the mean...
<p>Each point is the average of 10 runs, with the error bars denoting the standard error on the mean...
<p>Shown are the results for (red), (green) and (blue), as well as for the full BHC method (black...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the SRBCT da...
<p>Shown are the results for (red), (green) and (blue). The horizontal dashed line shows the full...
Accuracy of Algorithm 1 on the synthetic datasets (left) and the KC dataset (right). Each line denot...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the Brain tu...
<p>Solid, dotted and dashed lines represents the averaged computation times required for solving the...
The comparison of the average running time of the examined methods for 150 experiments executed for ...
(a) The run time as a function of spike train length using Knight’s method (black), our method (red)...
<p>The figure shows the runtimes of the tested algorithms, at different percentages of the study cas...
Computational results of the ICC algorithm for the illustrative example, where fsr, nsr and are cal...
The evaluation metrics computed from best result of the BHCNet-3 in each magnification factor and co...
<p>Each data point is obtained by averaging over ten runs, each of which has an independently random...
<p>The horizontal dashed line indicates the average value of for parameter estimates using the true...
<p>Each point is the average of 10 runs, with the error bars denoting the standard error on the mean...
<p>Each point is the average of 10 runs, with the error bars denoting the standard error on the mean...
<p>Shown are the results for (red), (green) and (blue), as well as for the full BHC method (black...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the SRBCT da...
<p>Shown are the results for (red), (green) and (blue). The horizontal dashed line shows the full...
Accuracy of Algorithm 1 on the synthetic datasets (left) and the KC dataset (right). Each line denot...
<p>The average and scores produced by 50 consecutive runs of different algorithms for the Brain tu...
<p>Solid, dotted and dashed lines represents the averaged computation times required for solving the...
The comparison of the average running time of the examined methods for 150 experiments executed for ...
(a) The run time as a function of spike train length using Knight’s method (black), our method (red)...
<p>The figure shows the runtimes of the tested algorithms, at different percentages of the study cas...
Computational results of the ICC algorithm for the illustrative example, where fsr, nsr and are cal...
The evaluation metrics computed from best result of the BHCNet-3 in each magnification factor and co...
<p>Each data point is obtained by averaging over ten runs, each of which has an independently random...
<p>The horizontal dashed line indicates the average value of for parameter estimates using the true...
DOI
Add to ORKG