Database Reference
In-Depth Information
37. G. Marconi. Wireless telegraphic communication. Nobel Price Lecture , 1909.
38. M. McGlohon, L. Akoglu, and C. Faloutsos. Weighted graphs and disconnected compo-
nents: Patterns and a generator. In Proceedings of the 14th ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining , pages 524-532, 2008. ACM.
39. S. Milgram. The small world problem. Psychology , 2(1):60-67, 1967.
40. R. Morris. Counting large numbers of events in small registers. Communications of the
ACM , 21(10):840-842, 1978.
41. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing
order to the web. Technical report, Stanford InfoLab, 1999.
42. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. Anf: A fast and scalable tool for data
mining in massive graphs. In Proceedings of the Eighth ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining , pages 81-90, 2002. ACM.
43. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-
modal correlation discovery. In Proceedings of the Tenth ACM SIGKDD International
Conference on Knowledge Discovery and Data Mining , pages 653-658, 2004. ACM.
44. S. Papadimitriou and J. Sun. Disco: Distributed co-clustering with map-reduce: A
case study towards petabyte-scale end-to-end mining. In Eighth IEEE International
Conference on Data Mining, ICDM'08 , pages 512-521, 2008. IEEE.
45. T. Seidl, B. Boden, and S. Fries. CC-MR-finding connected components in huge graphs
with mapreduce. Machine Learn. Knowledge Discov. Databases , pages 458-473, 2012.
46. B. P. Sinha, B. B. Bhattacharya, S. Ghose, and P. K. Srimani. A parallel algorithm to
compute the shortest paths and diameter of a graph and its vlsi implementation. IEEE
Trans. Comput ., 35(11):1000-1004, 1986.
47. C. E. Tsourakakis. Fast counting of triangles in large real networks without counting:
Algorithms and laws. In Proceedings of the 2008 Eighth IEEE International Conference
on Data Mining , ICDM'08 , pages 608-617, Washington, DC, USA, 2008. IEEE
Computer Society.
48. D. Woodruff. Optimal space lower bounds for all frequency moments. In Proceedings of
the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms , SODA'04 , pages
167-175, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics.
Search WWH ::




Custom Search