Mathematical and algorithmic aspects of web search

sala 0.31
Thursday, 3 April, 2008 - 10:30

We will present the procedures which are used in web search engines
for classifying the pages according to their importance. We will see
that the mathematical problem consists in the computation of the
dominant eigenvector of a stochastic irreducible matrix. Then, we will
see what are the numerical methods used for making this ranking, how
to accelerate their convergence and how extrapolation procedures could
improve them.

Speaker: 

Claude BREZINSKI Laboratoire Painlevé Université des Sciences et Tecnhologies de Lille 1 - France