PDF Publication Title:
Text from PDF Page: 177
Complexity, Dover Publications, 1998. Cited on page 130. [Parreira et al., 2006] J. X. Parreira, D. Donato, S. Michel, and G. Weikum. Efficient and decentralized PageRank approximation in a peer-to-peer web search network. In VLDB ’06: Proceedings of the 32nd international conference on Very large data bases, pp. 415–426. 2006. Cited on page 108. [RamanandChandra,2008]K.RamanandN.Chandra. My- cobacterium tuberculosis interactome analysis unravels potential pathways to drug resistance. BMC Microbiology, 8, p. 234, 2008. doi:10.1186/1471-2180-8-234. Cited on page 129. [Saad, 2003] Y. Saad. Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, Philadelphia, 2nd edition, 2003. Cited on page 25. [Scheinerman,2009]E.Scheinerman. Matgraph:Agraphthe- orytoolboxforMatlab. http://www.ams.jhu.edu/~ers/ matgraph/, 2009. Cited on page 120. [Schwab et al., 2000] M. Schwab, M. Karrenbach, and J. Claer- bout. Making scientific computations reproducible. Comput. Sci. Eng., 2 (6), pp. 61–67, 2000. doi:10.1109/5992.881708. Cited on page 141. [Serra-Capizzano, 2005] S. Serra-Capizzano. Jordan canon- ical form of the Google matrix: A potential contribution to the PageRank computation. SIAM Journal on Matrix Analysis and Applications, 27 (2), pp. 305–312, 2005. doi: 10.1137/S0895479804441407. Cited on pages 11, 31, and 143. [Shepelyansky and Zhirov, 2009] D. L. Shepelyansky and O. V. Zhirov. Google matrix and dynamical attractors. CoRR, abs/0905.4162, 2009. arXiv:abs/0905.4162. Cited on page 11. [Sieketal.,2001]J.G.Siek,L.-Q.Lee,andA.Lumsdaine. The Boost Graph Library: User Guide and Reference Manual, Addison- Wesley Professional, 2001. Cited on pages 117 and 122. [Singh et al., 2007] R. Singh, J. Xu, and B. Berger. Pairwise global alignment of protein interaction networks by matching neighbor- hood topology. In Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RE- COMB), pp. 16–31. 2007. doi:10.1007/978-3-540-71681-5_2. Cited on pages 7, 59, 90, 96, 112, and 113. [Talenti, 1987] G. Talenti. Recovering a function from a finite number of moments. Inverse Problems, 3 (3), pp. 501–517, 1987. doi:10.1088/0266-5611/3/3/016. Cited on page 68. [Tarjan, 1972] R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1 (2), pp. 146–160, 1972. doi:10.1137/0201010. Cited on pages 122 and 130. [Thelwall, 2003] M. Thelwall. A free database of university web links: Data collection issues. International Journal of Scientomet- rics, Informetrics and Bibliometrics, 6/7 (1), 2003. Cited on page 39. [Trefethen,2008]L.N.Trefethen. IsGaussquadraturebetter thanClenshaw-Curtis? SIAMReview,50(1),pp.67–87,2008. doi:10.1137/060659831. Cited on page 80. [Trefethen and Embree, 2005] L. N. Trefethen and M. Embree. Spectra and Pseudospectra: The Behavior of Nonnormal Matrices and Operators, Princeton University Press, Princeton, New Jersey, 2005. Cited on page 12. [vanderVorst,1992]H.A.vanderVorst. Bi-CGSTAB:Afast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 13 (2), pp. 631–644, 1992. doi:10.1137/ 0913035. Cited on page 96. [Varga, 1962] R. S. Varga. Matrix Iterative Analysis, Prentice Hall, 1962. Cited on pages 22 and 24. [Various,2007]Various. WikipediaXMLdatabasedumpfrom April 2, 2007. Accessed from http://en.wikipedia.org/wiki/ Wikipedia:Database_download, 2007. Cited on page 113. [Various, 2008] ———. The Library of Congress subject headings. http://lcsh.info recently moved to http://id.loc.gov, 2008. Removed from the web in early 2009, accessed in late 2008. Cited on page 113. [Various, 2009a] ———. Matlab central file exchange. Avail- able online http://www.mathworks.com/matlabcentral/ fileexchange/, 2009a. Cited on page 120. [Various,2009b]———. WikipediaXMLdatabasedumpfrom March6,2009. Accessedfromhttp://en.wikipedia.org/ wiki/Wikipedia:Database_download, 2009b. Cited on page 3. [Vigna, 2005] S. Vigna. TruRank: Taking PageRank to the limit. In WWW ’05: Special interest tracks and posters of the 14th in- ternational conference on World Wide Web, pp. 976–977. 2005. doi:10.1145/1062745.1062826. Cited on page 18. [Vigna, 2008] ———. Webgraph 2.1. http://webgraph.dsi.unimi.it/, 2008. Cited on page 137. [Vigna et al., 2008] S. Vigna, R. Posenato, M. Santini, and S.Vigna. LAW1.3.1:Libraryofalgorithmsforthewebgraph. http://law.dsi.unimi.it/software/docs/, 2008. Cited on pages 21, 24, and 102. [Wang,2002]M.Wang. Asignificantimprovementtocleveral- gorithm in hyperlinked environment. In Proceedings of the 11th international conference on the World Wide Web (WWW2002). 2002. Cited on page 60. [Watts and Strogatz, 1998] D. J. Watts and S. H. Strogatz. Collec- tive dynamics of “small-world” networks. Nature, 393 (6684), pp. 440–442, 1998. doi:10.1038/30918. Cited on pages 119 and 130. [White and Drucker, 2007] R. W. White and S. M. Drucker. Investigating behavioral variability in web search. In Proceedings of the 16th international conference on the World Wide Web (WWW2007), pp. 21–30. 2007. doi:10.1145/1242572.1242576. Cited on pages 55 and 61. [WillsandIpsen,2009]R.S.WillsandI.C.F.Ipsen. Ordinal ranking for Google’s PageRank. SIAM Journal on Matrix Analysis and Applications, 30, pp. 1677–1696, 2009. doi:10.1137/ 070698129. Cited on pages 21 and 23. [Witten and Frank, 2005] I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques, Morgan Kaufmann, 2005. Cited on page 92. [Witten et al., 1999] I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images, Morgan Kaufmann, San Francisco, 2nd edition, 1999. Cited on page 1. [Xiu and Hesthaven, 2005] D. Xiu and J. Hesthaven. High order collocation methods for the differential equation with random inputs. SIAM J. Sci. Comput., 27 (3), pp. 1118–1139, 2005. doi: 10.1137/040615201. Cited on page 75. [Xue et al., 2003] G.-R. Xue, H.-J. Zeng, Z. Chen, W.-Y. Ma, H.Zhang,andC.-J.Lu. Useraccesspatternenhancedsmall 7.2 ⋅ future work 157PDF Image | ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATION
PDF Search Title:
ALGORITHMS FOR PAGERANK SENSITIVITY DISSERTATIONOriginal File Name Searched:
gleich.pdfDIY 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 (Standard Web Page)