Before revision:  Computing  full k-NN graph in less than 10 seconds on  webspam dataset, using brute-force (n^2D), will require at least 20 TFLOPS.
After revision:  Computing a full k-NN graph in less than 10 seconds on webspam dataset, using brute-force (n^2D), will require at least 20 TFLOPS.