DIMACS Working Group on The Mathematics of Web Search and Meta-Search

June 19 - 26, 2004
Bertinoro International Center for Informatics, Bertorino, Italy

Organizers:
Cynthia Dwork, Microsoft, dwork@microsoft.com
Andrew Gelman, Columbia University, gelman@stat.columbia.edu
D. Sivakumar, IBM Almaden, siva@almaden
Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences.

Information on BICI can be found at http://www.cs.unibo.it/bici/.

Workshop Program:

This is a tentative program: 

Sunday, June 20, 2004

 1:00 -  1:45    Cynthia Dwork (Microsoft)
	         Rank aggregation and Social Choice

 2:00 -  2:45    Ravi Kumar (IBM)
	         A CS Perspective on Voting

 3:00 -  3:45    Andrei Broder (IBM)
	         Producing random samples from search results

 4:00 -  4:45    Werner Stuetzle (U. Washington)
	         Discussion of CS vs. Social Choice Theory

Monday, June 21, 2004

 1:00 -  1:45    Panayiotis Tsaparas (Helsinki)
	         TBA

 2:00 -  2:45    Moni Naor (Weizmann)
	         Peer-to-Peer Networks

 3:00 -  3:45    Frank McSherry (Microsoft)
                 Unifying a large class of optimizations to
                 Pagerank style computations

 4:00  - 4:45    D. Sivakumar (IBM)
	         A Graph-Theoretic Approach to extracting
		 Storylines from Search Results

Tuesday, June 22, 2004

11:00 - 11:45    Amy Langville (NC State)
	         Updating/Reordering for PageRank

 1:00  - 1:45    Nicole Immorlica (MIT and Microsoft)
	         TBA

 2:00 -  2:45    Dengyong Zhou (Max-Planck)

 3:00 -  3:45    Cynthia Dwork (Microsoft)
	         Randomized Reductions and Linear Programming
	         for Rank Aggregation Problems

 4:00 -  4:45    David Madigan (Rutgers)
                 TBA

Wednesday, June 23, 2004

11:00 - 11:45    Kevin McCurley (IBM)
		 TBA

 1:00 -  1:45    Steve Chien (Microsoft)
	         Cluster Convergence in Markov Chains

 2:00 -  2:45    Howard Rosenthal (Princeton)
	         TBA

 3:00 -  3:45    Debora Donato (Roma)
	         On the bow-tie structure of the web graph

 4:00 -  4:45    D. Sivakumar (IBM)
	         Efficient Similarity Search and Classification
				      via Rank Aggregation

Thursday, June 24, 2004

Outing to Urbino

Friday, June 25, 2004

11:00 -  11:45  Michael Rothschild (Princeton)
	        TBA

 1:00 -   5:00  Summary, short presentations, open problems
                15 mins. per speaker; Schedule TBA


Other participants:
Allan Borodin, Toronto 
Andrew Goldberg, Microsoft
Massimo Santini, Milano
Arthur Gretton, Max-Planck
Previous: Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on June 10, 2004.