-
2
-
-
38749085661
-
Local graph partitioning using page rank vectors
-
Andersen, Reid, Chung, Fan, and Lang, Kevin. Local graph partitioning using Page Rank vectors. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475-486, 2006.
-
(2006)
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
, pp. 475-486
-
-
Andersen, R.1
Chung, F.2
Lang, K.3
-
3
-
-
33646442365
-
Page rank computation and the structure of the web: Experiments and algorithms
-
Arasu, Arvind, Novak, Jasmine, Tomkins, Andrew, and Tomlin, John. Page Rank computation and the structure of the web: Experiments and algorithms. In Proceedings of the 11th international conference on the World Wide Web, 2002.
-
(2002)
Proceedings of the 11th International Conference on the World Wide Web
-
-
Arasu, A.1
Novak, J.2
Tomkins, A.3
Tomlin, J.4
-
4
-
-
84873329588
-
Runtime guarantees for regression problems
-
Chin, Hui Han, Mdry, Aleksander, Miller, Gary L., and Peng, Richard. Runtime guarantees for regression problems. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 269-282, 2013.
-
(2013)
Proceedings of the 4th Conference on Innovations in Theoretical Computer Science
, pp. 269-282
-
-
Chin, H.H.1
Mdry, A.2
Miller, G.L.3
Peng, R.4
-
5
-
-
34548748711
-
Weighted graph cuts without eigenvectors: A multilevel approach
-
Dhillon, Indeijit S., Guan, Yuqiang, and Kulis, Brian. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Trans. Pattern Anal. Mach. Intell., 29(11):1944-1957, 2007.
-
(2007)
IEEE Trans. Pattern Anal. Mach. Intell.
, vol.29
, Issue.11
, pp. 1944-1957
-
-
Dhillon, I.S.1
Guan, Y.2
Kulis, B.3
-
6
-
-
0024090156
-
A new approach to the maximum-flow problem
-
Goldberg, Andrew V. and Tarjan, Robert E. A new approach to the maximum-flow problem. Journal of the ACM, 35(4):921-940, 1988.
-
(1988)
Journal of the ACM
, vol.35
, Issue.4
, pp. 921-940
-
-
Goldberg, A.V.1
Tarjan, R.E.2
-
7
-
-
80052413037
-
Unifying guilt-by- association approaches: Theorems and fast algorithms
-
Koutra, Danai, Ke, Tai-You, Kang, U., Chau, Duen Horng, Pao, Hsing-Kuo Kenneth, and Faloutsos, Christos. Unifying guilt-by- association approaches: Theorems and fast algorithms. In Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases, pp. 245-260, 2011.
-
(2011)
Proceedings of the 2011 European Conference on Machine Learning and Knowledge Discovery in Databases
, pp. 245-260
-
-
Koutra, D.1
Ke, T.-Y.2
Kang, U.3
Chau, D.H.4
Pao, H.-K.K.5
Faloutsos, C.6
-
10
-
-
84924178998
-
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
-
Leskovec, Jure, Lang, Kevin J., Dasgupta, Anirban, and Mahoney, Michael W. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
-
(2009)
Internet Mathematics
, vol.6
, Issue.1
, pp. 29-123
-
-
Leskovec, J.1
Lang, K.J.2
Dasgupta, A.3
Mahoney, M.W.4
-
12
-
-
84869155042
-
A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
-
Mahoney, Michael W., Orecchia, Lorenzo, and Vishnoi, Nisheeth K. A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. Journal of Machine Learning Research, 13:2339-2365, 2012.
-
(2012)
Journal of Machine Learning Research
, vol.13
, pp. 2339-2365
-
-
Mahoney, M.W.1
Orecchia, L.2
Vishnoi, N.K.3
-
13
-
-
33749468596
-
Finding community structure in networks using the eigenvectors of matrices
-
Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74:036104, 2006.
-
(2006)
Phys. Rev. E
, vol.74
, pp. 036104
-
-
Newman, M.E.J.1
-
16
-
-
0003780986
-
The page rank citation ranking: Bringing order to the web
-
November
-
Page, Lawrence, Brin, Sergey, Motwani, Rajeev, and Winograd, Terry. The Page Rank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford University, November 1999.
-
(1999)
Technical Report 1999-66, Stanford University
-
-
Page, L.1
Brin, S.2
Motwani, R.3
Winograd, T.4
-
17
-
-
0000307001
-
Solution of sparse rectangular systems using LSQR and CRAIG
-
Saunders, Michael A. Solution of sparse rectangular systems using LSQR and CRAIG. BIT Numerical Mathematics, 35(4): 588-604, 1995.
-
(1995)
BIT Numerical Mathematics
, vol.35
, Issue.4
, pp. 588-604
-
-
Saunders, M.A.1
-
19
-
-
84899006908
-
Learning with local and global consistency
-
Zhou, Dengyong, Bousquet, Olivier, Lai, Thomas Navin, Weston, Jason, and SchSlkopf, Bernhard. Learning with local and global consistency. In Advances in Neural Information Processing Systems 16, pp. 321-328, 2004.
-
(2004)
Advances in Neural Information Processing Systems
, vol.16
, pp. 321-328
-
-
Zhou, D.1
Bousquet, O.2
Lai, T.N.3
Weston, J.4
SchSlkopf, B.5
|