Program



Monday, February 6, 2006


11:00 Registration
11:45 Opening - Welcome reception
11:55 Welcome address: Prof. Ugo Montanari


12:00 Keynote talk: From Page Rank to Hubs and Authorities
Apostolos Gerasoulis



12:50 Lunch


14:30 Keynote talk: Mining Web Queries
Ricardo Baeza-Yates

15:20 Scalable and robust on-line learning algorithms
Nicolò Cesa-Bianchi


15:45 Analysis and Computation of Google's PageRank
Ilse Ipsen


16:10 Speeding up cosine-similarity queries via random clustering
Alessandro Panconesi


16:35 coffee break


17:00 Graph fibrations, graph isomorphism, and PageRank
Paolo Boldi


17:30 Standard Canonical Forms for Certain Rank one Perturbation and an Application to the Google PageRank Problem
Stefano Serra Capizzano


17:50 Damping Functions for Link-based Ranking
Carlos Castillo

Tuesday, February 7, 2006


9:00 Keynote talk: Numerical Methods for Rapid Computation of PageRank
Gene H. Golub


9.50 Web Ranking forecast
Michalis Vazirgiannis


10:15 XML Compression and Indexing
Paolo Ferragina


10:40 Computation, approximation, and acceleration of the PageRank vector
Claude Brezinski


11:05 coffee break


11:30 Keynote talk: Distributed Statistics for Peer-to-Peer Web Search
Gerhard Weikum


12:20 On Perron-Frobenius Property of Matrices having some Negative Entries
Dimitros Noutsos


12:45 A Stochastic Model for the Link Analysis of the Web
Francesco Romani


13:10 lunch


14:50 Learning in Web Domains
Marco Gori


15:15 Metasearching: fast and accurate clustering of web snippets with Armil
Marco Pellegrini


15:40 Mining the Inner Structure of the Webgraphs
Debora Donato


16:05 Ranking a stream of News information
Antonio Gullì


16:30 coffee break