THÔNG TIN TÀI LIỆU
Thông tin cơ bản
| Định dạng | |
|---|---|
| Số trang | 96 |
| Dung lượng | 11,31 MB |
Nội dung
Ngày đăng: 26/01/2021, 21:16
Nguồn tham khảo
| Tài liệu tham khảo | Loại | Chi tiết | ||||
|---|---|---|---|---|---|---|
| [10] Josep.M. Pujol et al., "The Little Engine(s) that Could: Scaling Online Social Networks", Proc. ACM SIGCOMM 2010 Conf. (SIGCOMM 10), ACM Press, pp.375–386, 2010 | Sách, tạp chí |
|
||||
| [33] PGS.TS Nguyễn Hải Thanh, “Tối ưu hóa”, NXB Bách Khoa – Hà Nội, 2006 Internet | Sách, tạp chí |
|
||||
| [1] S. Dutt. New faster Kernighan-Lin-type graph partitioning algorithms. In Proc. IEEE Intl. Conf.Computer-Aided Design, pages 370-377, 1993 | Khác | |||||
| [2] Per-Olof Fjallstrom, Algorithms for Graph Partitioning, Department of Computer and Information Science, Linkoping University, Linkoping, Sweden Generals,1998 | Khác | |||||
| [3] Duc A. Tran, S-CLONE: Socially-aware data replication for social networks, Department of Computer Science, University of Massachusetts, Boston, MA 02125, USA, 2013 | Khác | |||||
| [4] Josep M. Pujol, The Little Engine(s) That Could: Scaling Online Social Networks, PhD on Computer Science and Artificial Intelligence,Technical University of Catalonia, 2010 | Khác | |||||
| [5] Ulrich Elsner, Graph Partitioning, Sonderforschungsbereich 393, Numerische Simulation auf massiv parallelen Rechnern ,1997 | Khác | |||||
| [6] C. Fiduccia and R. Mattheyses. A linear time heuristic for improving network partitions. In 19th IEEE Design Automation Conference, pages 175-181, 1982 | Khác | |||||
| [7] Duc A. Tran, Socially Aware Data Partitioning for Distributed Storage of Social Data, Department of Computer Science, University of Massachusetts - Boston, 2013 | Khác | |||||
| [8] Oscar Ricardo Moll Thomae, Database Partitioning Strategies for Social Network Data, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2012 | Khác | |||||
| [9] Jiawei Han, Micheline Kamber. Data Mining Concepts and Techniques, 2nd edition. Morgan Kaufman Publishers. Pages 555-560 | Khác | |||||
| [11] Kazuya Okamoto, Wei Chen, and Xiang-Yang Li Ranking of Closeness Centrality for Large-Scale Social Networks | Khác | |||||
| [14] M. Faloutsos, P. Faloutsos and C. Faloutsos, Comp. Comm. Rev. 29, 251,1999 | Khác | |||||
| [16] Nikolaos Theodoros Korfiatis. The opinion evaluation network: ranking imprecise social interactions, Master Thesis, Department of computer and systems sciences, Royal Institute of Technology, Pages 7-28, 2005, Stockholm, Sweden | Khác | |||||
| [17] R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, 47, 2002 | Khác | |||||
| [18] R. Albert, H. Jeong and A.-L. Barabási, Nature (London) 401, 130, 1999 | Khác | |||||
| [19] Robert A. Hanneman, Mark Riddle. Introduction to social network methods. Technical report, University of California, Riverside, 2005 | Khác | |||||
| [20] S. H. Strogatz, Nature (London) 410, 268, 2000. [21] S. N. Dorogovtsev and J. F. F. Mendes, Adv. Phys. 51, 1079, 2002 | Khác | |||||
| [22] S. Wasserman and K. Faust, Social Network Analysis (Cambridge Univ. Press, Cambridge, UK, 1994 | Khác | |||||
| [23] Tieyun Qian,Yang Yang and Shuo Wang, Refining Graph Partitioning for Social Network Clustering, Springer-Verlag Berlin Heidelberg, 2010 | Khác |
TÀI LIỆU CÙNG NGƯỜI DÙNG
TÀI LIỆU LIÊN QUAN