3 ms·
Ooooh - http://www.pdl.cmu.edu/SDI/2013/slides/big_graph_nsa_rd_2013_56002v1.pdf http://www.pdl.cmu.edu/SDI/2013/slides/big_graph_nsa_rd_2013...
by merinid 13y ago
Ooooh - http://www.pdl.cmu.edu/SDI/2013/slides/big_graph_nsa_rd_2013_56002v1.pdf http://www.pdl.cmu.edu/SDI/2013/slides/big_graph_nsa_rd_2013...
- angersock 13y agoNice find. This paper seems to suggest that a possible counter attack is to create bogus edges and adjacencies--thus fucking with the utility of a (sparse) adjacency matrix or attempts at having useful window sizes for BFS or the like. I suspect, though, that any sort of attempt at that would somehow be thwarted and just cause more pain on the attempting party.
- timClicks 13y agoI find this especially interesting coupled with Cray's YarcData graph analytics hardware called Urika, which has 512 terabytes in memory. http://www.yarcdata.com/Products/ http://www.yarcdata.com/Products/