Unchained Preppers
General Category => General Discussion => Topic started by: Nemo on March 23, 2015, 12:20:42 PM
-
Go spend some of it reading another story about those cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue.
But I know some of the guys here will find it interesting.
Nemo :dance:
http://www.theblaze.com/stories/2015/03/23/this-nfl-player-just-released-the-last-thing-youd-expect-an-offensive-lineman-to-release/ (http://www.theblaze.com/stories/2015/03/23/this-nfl-player-just-released-the-last-thing-youd-expect-an-offensive-lineman-to-release/)
-
Yeah those cascadic multigrid algorithms for fast computation of the Fiedler vector of a graph Laplacian get me every time.
-
Excuse me...I need some privacy... :drool:
-
JM, if you have any remote semblance of accuracy in the comment above, you have truly "gone round the bend".
Nemo
-
:lmfao: :dancingBanana: