Recently, the research community has devoted increased attention to reducing the computational time needed by web ranking algorithms. In particular, many techniques have been proposed to speed up theâ€¦ (More)

According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have proposed commercialâ€¦ (More)

In this paper, we present heuristic techniques for the reduction of the bandwidth of a sparse matrix as well as for the reduction of the cost of the associated Cholesky factorization. Our algorithmsâ€¦ (More)

Given an $m\times m$ sparse symmetric matrix, we consider the problem of finding the permutation of rows and columns which minimizes the bandwidth. This problem is known to be NP-complete thereforeâ€¦ (More)

After the phenomenal success of the PageRank algorithm, many researchers have extended the PageRank approach to ranking graphs with richer structures in addition to the simple linkage structure.â€¦ (More)

We consider the problem of inverting block circulant with circulant blocks (BCCB) matrices with entries over the field Zp. This problem arises in the study of of two-dimensional linear cellularâ€¦ (More)

In this paper we consider the problem of estimating the largest eigenvalue and the corresponding eigenvector of a symmetric matrix. In particular, we consider iterative methods, such as the powerâ€¦ (More)

The research community has devoted an increased attention to reduce the computation time needed by Web ranking algorithms. Many efforts have been devoted to improve PageRank [4, 23], the well knownâ€¦ (More)