Pages that link to "Item:Q2354453"
From MaRDI portal
The following pages link to On efficient randomized algorithms for finding the PageRank vector (Q2354453):
Displaying 12 items.
- Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem (Q544781) (← links)
- The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (Q736033) (← links)
- Secure fast evaluation of iterative methods: with an application to secure PageRank (Q826235) (← links)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- A Hessenberg-type algorithm for computing PageRank problems (Q2118965) (← links)
- Deterministic coresets for stochastic matrices with applications to scalable sparse PageRank (Q2327492) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration (Q3435011) (← links)
- About the Power Law of the PageRank Vector Component Distribution. Part 1. Numerical Methods for Finding the PageRank Vector (Q4636840) (← links)
- Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
- Effective Computation of a Feedback Arc Set Using PageRank (Q6181948) (← links)
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities (Q6552619) (← links)
