Pages that link to "Item:Q5259568"

The following pages link to Solving SDD linear systems in nearly <i>m</i> log ^1/2 <i>n</i> time (Q5259568):

Displaying 16 items.

• A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system (Q262960) (← links)
• A queueing network-based distributed Laplacian solver (Q1979459) (← links)
• Electrical flows over spanning trees (Q2097649) (← links)
• Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
• Fitting a graph to one-dimensional data (Q2663044) (← links)
• The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach (Q2954044) (← links)
• The game theoretic<i>p</i>-Laplacian and semi-supervised learning with few labels (Q4644688) (← links)
• (Q5009600) (← links)
• A stochastic process on a network with connections to Laplacian systems of equations (Q5066880) (← links)
• Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
• (Q5090373) (← links)
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
• Space Hardness of Solving Structured Linear Systems. (Q6065465) (← links)
• A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
• Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition (Q6069849) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)