PDF Publication Title:
Text from PDF Page: 173
BIBLIOGRAPHY [Agresti, 2002] A. Agresti. Categorical Data Analysis, John Wiley and Sons, 2002. Cited on page 70. [Alexandrescu,2001]A.Alexandrescu. ModernC++Design: Generic Programming and Design Patterns Applied, Addison- WesleyProfessional,2001.Citedonpage122. [AlpertandHajaj,2008]J.AlpertandN.Hajaj. Weknewthe web was big . . . . Official Google Blog. Available online http:// googleblog.blogspot.com/2008/07/we- knew- web- was- big. html, 2008. Accessed on July 11, 2009. Cited on pages 20 and 136. [Andersen et al., 2006] R. Andersen, F. Chung, and K. Lang. Local graphpartitioningusingPageRankvectors. InProceedingsof the 47th Annual IEEE Symposium on Foundations of Computer Science. 2006. Cited on pages 6, 11, 28, and 59. [Arasu et al., 2002] A. Arasu, J. Novak, A. Tomkins, and J. Tomlin. PageRank computation and the structure of the web: Experiments and algorithms. In Proceedings of the 11th international conference on the World Wide Web. 2002. Poster session. Cited on pages 24 and 96. [Asmussen and Glynn, 2007] S. Asmussen and P. W. Glynn. Stochastic Simulation: Algorithms and Analysis, Springer, 2007. Cited on pages 70 and 72. [Atkinson, 2009] M. P. Atkinson. Mathematical Models of Terror Interdiction. Ph.D. thesis, Stanford University, 2009. Cited on page 148. [Avrachenkov et al., 2007] K. Avrachenkov, N. Litvak, and K.S.Pham. DistributionofPageRankmassamongprinciple components of the web. In Proceedings of the 5th Workshop on Algorithms and Models for the Web Graph (WAW2007), pp. 16–28. 2007. doi:10.1007/978-3-540-77004-6_2. Cited on pages 29, 55, 60, and 144. [Baeza-Yates et al., 2006] R. Baeza-Yates, P. Boldi, and C.Castillo. GeneralizingPageRank:Dampingfunctionsfor link-based ranking algorithms. In Proceedings of the 29th annual international ACM SIGIR conference on Research and develop- ment in information retrieval (SIGIR2006), pp. 308–315. 2006. doi:10.1145/1148170.1148225. Cited on pages 61 and 68. [Baeza-Yates and Ribeiro-Neto, 1999] R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval, Addison Wesley, 1999. Cited on page 1. [Barabási et al., 1999a] A.-L. Barabási, H. Jeong, and R. Albert. Diameter of the world wide web. Nature, 401, pp. 130–131, 1999a. doi:10.1038/43601. Cited on page 39. [Barabási et al., 1999b] ———. The www network. Accessed online via http://www.nd.edu/~networks/resources.htm in May 2009, 1999b. Cited on page 39. [Batagelj and Zaversnik, 2003] V. Batagelj and M. Zaversnik. An O(m) algorithm for cores decomposition of networks. arXiv, 2003. arXiv:cs/0310049v1. Cited on page 130. [Bayati et al., 2009] M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang. Algorithms for large, sparse net- workalignmentproblems. arXiv,0907.3338,p.Online,2009. arXiv:0907.3338. Cited on page 113. [Becchetti et al., 2008] L. Becchetti, C. Castillo, D. Donato, R. Baeza-Yates, and S. Leonardi. Link analysis for web spam detection. ACM Trans. Web, 2 (1), pp. 1–42, 2008. doi:10.1145/ 1326561.1326563. Cited on pages 91, 92, 93, and 146. [Berkhin,2005]P.Berkhin. AsurveyonPageRankcomputing. Internet Mathematics, 2 (1), pp. 73–120, 2005. Cited on pages 41 and 46. [Berkhin et al., 2008] P. Berkhin, U. M. Fayyad, P. Raghavan, and A. Tomkins. User-sensitive PageRank. United States Patent Application 20080010281, 2008. Cited on page 61. [Berman and Plemmons, 1994] A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences, SIAM, 1994. Cited on page 14. [Bianchini et al., 2005] M. Bianchini, M. Gori, and F. Scarselli. Inside PageRank. ACM Transactions on Internet Technologies, 5 (1), pp. 92–128, 2005. doi:10.1145/1052934.1052938. Cited on page 26. [Boldi, 2005] P. Boldi. TotalRank: Ranking without damping. In Poster Proceedings of the 14th international conference on the WorldWideWeb(WWW2005),pp.898–899.2005. Citedon pages 61, 63, and 89. [Boldi et al., 2004] P. Boldi, B. Codenotti, M. Santini, and S. Vigna. UbiCrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34 (8), pp. 711–726, 2004. doi:10.1002/spe.587. Cited on pages 34 and 39. [Boldi et al., 2007] P. Boldi, R. Posenato, M. Santini, and S. Vigna. Traps and pitfalls of topic-biased PageRank. In WAW2006, Fourth International Workshop on Algorithms and Models for the Web-Graph, pp. 107–116. 2007. doi: 10.1007/978-3-540-78808-9_10. Cited on pages 15, 16, 47, and 86. [Boldi et al., 2005] P. Boldi, M. Santini, and S. Vigna. PageRank as a function of the damping factor. In Proceedings of the 14th international conference on the World Wide Web (WWW2005). 2005. doi:10.1145/1060745.1060827. Cited on pages 29, 30, 41, 46, and 143. [Boldi et al., 2009] ———. Permuting web graphs. In WAW ’09: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, pp. 116–126. 2009. doi:10.1007/ 978-3-540-95995-3_10. Cited on page 117. [Boldi and Vigna, 2004] P. Boldi and S. Vigna. The Webgraph Framework I: Compression techniques. In Proceedings of the 13th international conference on the World Wide Web, pp. 595–602. 2004. doi:10.1145/988672.988752. Cited on pages 72, 88, 96, and 108. [Boldi and Vigna, 2005] ———. Codes for the world wide web. Internet Mathematics, 2 (4), pp. 407–429, 2005. Cited on pages 34, 39, 96, 104, 117, 137, and 142. [Brandes and Erlebach, 2005] U. Brandes and T. Erlebach, editors. Network Analysis: Methodological Foundations, Springer, 2005. doi:10.1007/b106453. Cited on pages 4 and 156. 153PDF 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 | RSS | AMP |