4:29 pm April 20th, 2008 by wkallander

Just a quick not about sharing papers with Justin Becker a couple of days ago. I sent him a copy of Professor Wu’s paper on Davis Social Links[1] that he and I had missed before (to fill in details not in the slides). Also, I sent him [2] because I thought it might be relevant (I had skipped over the random graph stuff in reading it before because it was not relevant at the time).

[1] Banks, L., Ye, S., Huang, Y., and Wu, S. F. 2007. Davis social links: integrating social networks with internet routing. In Proceedings of the 2007 Workshop on Large Scale Attack Defense (Kyoto, Japan, August 27 – 27, 2007). LSAD ’07. ACM, New York, NY, 121-128. DOI= http://doi.acm.org/10.1145/1352664.1352671

[2] Chakrabarti, D. and Faloutsos, C. 2006. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38, 1 (Jun. 2006), 2. DOI= http://doi.acm.org/http://doi.acm.org/10.1145/1132952.1132954

This entry was posted on Sunday, April 20th, 2008 at 4:29 pm and is filed under ECS289M. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.