nips nips2001 nips2001-169 nips2001-169-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Jon M. Kleinberg
Abstract: unkown-abstract
[1] D. Achlioptas, A. Fiat, A. Karlin, F. McSherry, “Web search via hub synthesis,” Proc. 42nd IEEE Symp. on Foundations of Computer Science, 2001.
[2] L. Adamic, R. Lukose, A. Puniyani, B. Huberman, “Search in Power-Law Networks,” Phys. Rev. E, 64 46135 (2001)
[3] B. Bollob´s, F. Chung, “The diameter of a cycle plus a random matching,” SIAM a J. Disc. Math. 1(1988).
[4] S. Chakrabarti, M. van den Berg, B. Dom, “Focused crawling: A new approach to topic-specific Web resource discovery,” Proc. 8th Intl. World Wide Web Conf., 1999.
[5] J. Cho, H. Garcia-Molina, L. Page, “Efficient Crawling Through URL Ordering,” Proc. 7th Intl. World Wide Web Conf., 1998.
[6] D. Cohn and T. Hofmann, “The Missing Link – A Probabilistic Model of Document Content and Hypertext Connectivity,” Adv. Neural Inf. Proc. Sys. (NIPS) 13, 2000.
[7] I. Clarke, O. Sandberg, B. Wiley, T. Hong, “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” International Workshop on Design Issues in Anonymity and Unobservability, 2000.
[8] M. Diligenti, F.M. Coetzee, S. Lawrence, C.L. Giles, M. Gori, “Focused Crawling Using Context Graphs,” Proc. 26th Intl. Conf. on Very Large Databases (VLDB), 2000.
[9] L. Getoor, N. Friedman, D. Koller, and B. Taskar. “Learning Probabilistic Models of Relational Structure,” Proc. 18th International Conference on Machine Learning, 2001.
[10] Gnutella. http://gnutella.wego.com.
[11] J. Guare, Six Degrees of Separation: A Play (Vintage Books, New York, 1990).
[12] D. Kempe, J. Kleinberg, A. Demers. “Spatial gossip and resource location protocols,” Proc. 33rd ACM Symp. on Theory of Computing, 2001.
[13] P. Killworth, H. Bernard, “Reverse small world experiment,” Social Networks 1(1978).
[14] J. Kleinberg. “Navigation in a Small World.” Nature 406(2000).
[15] J. Kleinberg. “The small-world phenomenon: An algorithmic perspective.” Proc. 32nd ACM Symposium on Theory of Computing, 2000. Also appears as Cornell Computer Science Technical Report 99-1776 (October 1999).
[16] M. Kochen, Ed., The Small World (Ablex, Norwood, 1989).
[17] S. Milgram, “The small world problem,” Psychology Today 1(1967).
[18] M. Newman, D. Watts, S. Strogatz, “Random graph models of social networks,” Proc. Natl. Acad. Sci., to appear.
[19] A. Oram, editor, Peer-to-Peer: Harnessing the Power of Disruptive Technologies O’Reilly and Associates, 2001.
[20] A. Puniyani, R. Lukose, B. Huberman, “Intentional Walks on Scale Free Small Worlds,” HP Labs Information Dynamics Group, at http://www.hpl.hp.com/shl/.
[21] S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, “A Scalable ContentAddressable Network,” Proc. ACM SIGCOMM, 2001
[22] A. Rowstron, P. Druschel, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” Proc. 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001.
[23] I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001
[24] D. Watts, P. Dodds, M. Newman, personal communication, December 2001.
[25] D. Watts, S. Strogatz, “Collective dynamics of small-world networks,” Nature 393(1998).
[26] H. Zhang, A. Goel, R. Govindan, “Using the Small-World Model to Improve Freenet Performance,” Proc. IEEE Infocom, 2002.