Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation
Myriad of graph-based algorithms in machine learning and data mining require parsing
relational data iteratively. These algorithms are implemented in a large-scale distributed …
relational data iteratively. These algorithms are implemented in a large-scale distributed …
Distributed randomized algorithms for the PageRank computation
In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the
search results. The algorithm quantifies the importance of each web page based on the link …
search results. The algorithm quantifies the importance of each web page based on the link …
An inner-outer iteration for computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to
the linear system formulation of the problem, using inner-outer stationary iterations. It is …
the linear system formulation of the problem, using inner-outer stationary iterations. It is …
Resiliency in numerical algorithm design for extreme scale simulations
This work is based on the seminar titled 'Resiliency in Numerical Algorithm Design for
Extreme Scale Simulations' held March 1–6, 2020, at Schloss Dagstuhl, that was attended …
Extreme Scale Simulations' held March 1–6, 2020, at Schloss Dagstuhl, that was attended …
A web aggregation approach for distributed randomized PageRank algorithms
The PageRank algorithm employed at Google assigns a measure of importance to each
web page for rankings in search results. In our recent papers, we have proposed a …
web page for rankings in search results. In our recent papers, we have proposed a …
The PageRank vector: properties, computation, approximation, and acceleration
An important problem in Web search is determining the importance of each page. After
introducing the main characteristics of this problem, we will see that, from the mathematical …
introducing the main characteristics of this problem, we will see that, from the mathematical …
Random node-asynchronous graph computations: Novel opportunities for discrete-time state-space recursions
For the analysis of data defined over irregular domains, the recent area of graph signal
processing extends classical signal processing techniques to the case of graphs. A …
processing extends classical signal processing techniques to the case of graphs. A …
Site-based partitioning and repartitioning techniques for parallel pagerank computation
The PageRank algorithm is an important component in effective web search. At the core of
this algorithm are repeated sparse matrix-vector multiplications where the involved web …
this algorithm are repeated sparse matrix-vector multiplications where the involved web …
[HTML][HTML] A new stop** criterion for linear perturbed asynchronous iterations
JC Miellou, P Spiteri, D El Baz - Journal of Computational and Applied …, 2008 - Elsevier
A new stop** criterion for linear perturbed asynchronous iterations - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Help Search My account Sign in …
main contentSkip to article Elsevier logo Journals & Books Help Search My account Sign in …
Convergence of distributed randomized PageRank algorithms
W Zhao, HF Chen, HT Fang - IEEE Transactions on automatic …, 2013 - ieeexplore.ieee.org
The PageRank algorithm employed by Google quantifies the importance of each page by
the link structure of the web. To reduce the computational burden the distributed randomized …
the link structure of the web. To reduce the computational burden the distributed randomized …