<p>Previous work has shown that image datasets have so much structure that a mere random projection of the dataset onto a 1D subspace is likely to uncover some of that structure. We subsequently
†R = 0.960;‡R = 0.945.aNr is the average number of located roots per run, aNFEr is the average number of function evaluations required to locate a root, aTr is the average time required to locate a ro
