MODELS AND ALGORITHMS FOR PAGERANK SENSITIVITY

PDF Publication Title:

MODELS AND ALGORITHMS FOR PAGERANK SENSITIVITY ( models-and-algorithms-for-pagerank-sensitivity )

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

Text from PDF Page: 009

ACKNOWLEDGMENTS A thesis reflects an individual’s work. It should show a capacity for novel research at the brink of human knowledge. It should demonstrate deep insight into a problem. And all of this should translate into a document written by one. The singularity of this view feels wrong. Research does not exist in a vacuum. During my time at Stanford, I’ve had the pleasure of talking and working with many others. This thesis is my work, but the influence of all these interactions is considerable. It will be difficult to acknowledge everyone. Nevertheless, I will try. Before getting started, I need to acknowledge my funding. In my second year, I worked under the Department of Energy Advanced Simulation and Computing (DOE ASC) grant. NSF grant CCF-0430617 funded my research during my third year. Support for my fourth and fifth years was generously provided by Microsoft through a Microsoft Research/Live Labs Fellowship. Finally, two quarters of summer work were under the Computational Ap- proaches to Digital Stewardship grant from the Library of Congress. First, I’d like to thank the members of my thesis committees. Art Owen, Hector Garcia Molina, Chen Greif, Amin Saberi, and Michael Saunders pa- tiently listened to my defense and gave me useful feedback. Also, Chen, Amin, and Michael read through this document and provided essential input. I’m extremely grateful for the time each member spent working to make this thesis better. Second, the ICME staff has been amazing. Seth Tornborg and Brian Tempero—the ICME computer guys—always ensured I had the latest com- puters. This relationship helped when I needed to experiment on some of these big graphs. Deb Michaels, Priscilla Williams, and Mayita Romero kept ICME running during my graduate career. They occasionally arranged pizza or other treats. Finally, I would never have graduated from Stanford without Indira Choudhury. Indira helped me wade through the bureaucracy. She made it easy for me to focus on research. Third, the ICME students are equally amazing. We had bar nights, bar- becues, beach trips, baseball, and basketball—and those are just the b’s. The students provided a social component that made ICME a great place to spend five years studying. Of course, the students are extremely sharp. It was great to be able to sit at a white board with almost anyone and debate merits and demerits of almost anything in computational mathematics. Some of my closest friends and classmates are: Esteban Arcaute, Michael Atkinson, Andrew Bradley, Paul Constantine, Adam Guetz, Nick Henderson, Jeremy Kozdon, Chris Maes, Nicole Taheri, Ying Wang, and Nick West. In particular, Jeremy Kozdon, Michael Atkinson, Paul Constantine and I sur- vived five years together in the four different offices (Durand 110, 102, 112, and Terman 396). We all developed different research, different advisers, and ix

PDF Image | MODELS AND ALGORITHMS FOR PAGERANK SENSITIVITY

PDF Search Title:

MODELS AND ALGORITHMS FOR PAGERANK SENSITIVITY

Original File Name Searched:

gleich-pagerank-thesis.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 (Standard Web Page)