Information Technology Reference
In-Depth Information
12. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-
Addressable Network. In: Proc. of ACM SIGCOMM 2001, pp. 329-350 (2001)
13. Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-Tolerant
Wide-Area Location and Routing. Technical Report UCB/CSD-01-1141, Computer Sci-
ence Division, UC Berkeley (2001)
14. Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location and Routing
for Large-Scale Peer-to-Peer Systems. In: Proc. of the 18the IFIP/ACM International
Conference on Distributed Systems Platforms (Middleware) (2001)
15. Rowstron, A., Kermarrec, A.-M., Druschel, P.: SCRIBE: The design of a large-scale
event notification infrastructure. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001.
LNCS, vol. 2233, p. 30. Springer, Heidelberg (2001)
16. Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.: Bayeux: An Ar-
chitecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination. In: Proc. 11th
Intl Workshop Network and Operating System Support for Digital Audio and Video
(NOSSDAV 2001) (2001)
17. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining: Current Status and Future
Directions. Data Min. Knowl. Disc., 55-86 (2007)
18. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In:
SIGMOD 2000, pp. 1-12 (2000)
19. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association rules. In: VLDB 1994,
pp. 487-505 (1994)
20. Baumgart, I., Heep, B., Krause, S.: OverSim: A Flexible Overlay Network Simulation
Framework. In: 10th IEEE Global Internet Symposium (GI 2007) in Conjunction with
IEEE INFOCOM 2007, pp. 79-84 (2007)
Search WWH ::




Custom Search