ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

PDF Publication Title:

ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION ( algorithms-for-pagerank-sensitivity-dissertation )

Previous Page View | Next Page View | Return to Search List

Text from PDF Page: 176

156 7 ⋅ conclusion [Kahaner, 1980] D. K. Kahaner. Algorithm 561: Fortran im- plementation of heap programs for efficient table mainte- nance. ACM Trans. Math. Softw., 6 (3), pp. 444–449, 1980. doi:10.1145/355900.355918. Cited on page 131. [Kamvar et al., 2004] S. D. Kamvar, T. H. Haveliwala, and G. H. Golub. AdaptivemethodsforthecomputationofPageRank. Linear Algebra Appl., 386, pp. 51–65, 2004. doi:10.1016/j.laa. 2003.12.008. Cited on page 96. [Kamvar et al., 2003] S. D. Kamvar, T. H. Haveliwala, C. D. Manning,andG.H.Golub. Extrapolationmethodsforac- celeratingPageRankcomputations. InProceedingsofthe12th international conference on the World Wide Web, pp. 261–270. 2003. doi:10.1145/775152.775190. Cited on pages 22, 60, 96, and 147. [Karande et al., 2009] C. Karande, K. Chellapilla, and R. An- dersen. Speeding up algorithms on compressed web graphs. In WSDM ’09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, pp. 272–281. 2009. doi:10.1145/1498759.1498836. Cited on page 96. [Karci,2008]M.H.Karci. HigherorderlevelableMRFEnergy Minimization via Graph Cuts. Ph.D. thesis, Middle East Technical University, 2008. Cited on page 124. [Katz, 1953] L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18 (1), pp. 39–43, 1953. Cited on pages 18, 55, and 60. [Keener, 1993] J. P. Keener. The Perron-Frobenius theorem and the ranking of football teams. SIAM Review, 35 (1), pp. 80–93, 1993. doi:10.1137/1035004. Cited on page 7. [Kleinberg, 1999] J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46 (5), pp. 604– 632, 1999. Cited on page 148. [KoldaandBader,2009]T.G.KoldaandB.W.Bader. Tensor decompositions and applications. SIAM Review, 51 (3), pp. 455– 500, 2009. doi:10.1137/07070111X. Cited on page 149. [Kollias et al., 2006] G. Kollias, E. Gallopoulos, and D. B. Szyld. Asynchronous iterative computations with web information retrieval structures: The PageRank case. In Parallel Computing: Current and Future Issues of High-End Computing (Proceedings of the International Conference Parco05), pp. 309–316. 2006. Cited on page 108. [Koschützki et al., 2005] D. Koschützki, K. A. Lehmann, L. Peeters, S. Richter, D. Tenfelde-Podehl, , and O. Zlo- towski. Centrality Indicies, chapter 3, pp. 16–61. Volume 3418 of [Brandes and Erlebach, 2005], 2005. doi:10.1007/b106453. Cited on page 4. [Langville, 2009] A. N. Langville. Sports ranking, 2009. From a draft of a forthcoming book. Cited on page 6. [Langville and Meyer, 2006a] A. N. Langville and C. D. Meyer. Google’s PageRank and Beyond: The Science of Search Engine Rankings, Princeton University Press, 2006a. Cited on pages 1, 11, 18, 19, 28, 43, 44, 49, 50, and 103. [Langville and Meyer, 2006b] ———. Updating Markov chains with an eye on Google’s PageRank. SIAM J. Matrix Anal. Appl., 27 (4), pp. 968–987, 2006b. doi:10.1137/040619028. Cited on page 96. [Latora and Marchiori, 2001] V. Latora and M. Marchiori. Efficient behavior of small world networks. Physical Review Letters, 87 (19), p. 198701, 2001. doi:10.1103/PhysRevLett.87. 198701. Cited on page 118. [Lee et al., 2008] H.-T. Lee, D. Leonard, X. Wang, and D. Logu- inov. IRLbot: scaling to 6 billion pages and beyond. In WWW ’08: Proceeding of the 17th international conference on World Wide Web, pp. 427–436. 2008. doi:10.1145/1367497.1367556. Cited onpage146. [Lempel and Moran, 2000] R. Lempel and S. Moran. The stochastic appraoch for link-structure analysis (SALSA) and the TKC effect. In The Ninth International World Wide Web Conference, pp. 387– 401. 2000. doi:10.1016/S1389-1286(00)00034-7. Cited on page 148. [Lin et al., 2008] J. M. Lin, J. W. Bohland, P. Andrews, G. A. P. C. Burns, C. B. Allen, and P. P. Mitra. An analysis of the abstracts presented at the annual meetings of the society for neuroscience from 2001 to 2006. PLoS ONE, 3 (4), p. e2052, 2008. doi:10.1371/journal.pone.0002052. Cited on page 129. [Lin et al., 2009] Y. Lin, X. Shi, and Y. Wei. On computing PageRank via lumping the Google matrix. Journal of Computational andAppliedMathematics,224(2),pp.702–708,2009. doi: 10.1016/j.cam.2008.06.003. Cited on page 96. [Manning et al., 2008] C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval, Cambridge University Press, 2008. Cited on page 1. [McSherry, 2005] F. McSherry. A uniform approach to accelerated PageRank computation. In Proceedings of the 14th international conferenceontheWorldWideWeb,pp.575–582.2005. doi: 10.1145/1060745.1060829. Cited on pages 16, 44, 96, and 108. [Meyer,2000]C.D.Meyer. Matrixanalysisandappliedlinear algebra, Society for Industrial and Applied Mathematics, Philadel- phia, PA, USA, 2000. Cited on pages 12, 29, 30, and 66. [Milovanović and Spalević, 2003] G. V. Milovanović and M. M. Spalević. Error bounds for Gauss-Turán quadrature formulae of analytic functions. Mathematics of Computation, 72, pp. 1855– 1872, 2003. doi:10.1090/S0025-5718-03-01544-8. Cited on page 148. [Morrison et al., 2005] J. L. Morrison, R. Breitling, D. J. Higham, and D. R. Gilbert. GeneRank: using search engine technology for the analysis of microarray experiments. BMC Bioinformatics, 6 (1), p. 233, 2005. doi:10.1186/1471-2105-6-233. Cited on pages 7, 11, 39, 59, and 90. [Najork et al., 2007] M. A. Najork, H. Zaragoza, and M. J. Tay- lor. HITS on the web: how does it compare? In Proceedings of the 30th annual international ACM SIGIR conference on Research and Development in information retrieval (SIGIR2007), pp. 471–478. 2007. doi:10.1145/1277741.1277823. Cited on pages 55, 60, and 146. [Nobile et al., 2008] F. Nobile, R. Tempone, and C. Webster. A sparse grid stochastic collocation method for partial differential equations with random input data. SIAM Journal on Numerical Analysis, 46 (5), pp. 2309–2345, 2008. doi:10.1137/060663660. Cited on page 75. [Page et al., 1999] L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Techni- cal Report 1999-66, Stanford University, 1999. Cited on pages 1, 11, 22, 26, 55, and 61. [Papadimitriou and Steiglitz, 1998] C. H. Papadimitriou and K.Steiglitz. CombinatorialOptimization:Algorithmsand

PDF Image | ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

PDF Search Title:

ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION

Original File Name Searched:

gleich.pdf

DIY PDF Search: Google It | Yahoo | Bing

Cruise Ship Reviews | Luxury Resort | Jet | Yacht | and Travel Tech More Info

Cruising Review Topics and Articles More Info

Software based on Filemaker for the travel industry More Info

The Burgenstock Resort: Reviews on CruisingReview website... More Info

Resort Reviews: World Class resorts... More Info

The Riffelalp Resort: Reviews on CruisingReview website... More Info

CONTACT TEL: 608-238-6001 Email: greg@cruisingreview.com | RSS | AMP