155 search results - page 1 / 31 » Fast matrix rank algorithms and applications |
STOC
2012
ACM
11 years 7 months ago
2012
ACM
SDM
2011
SIAM
12 years 7 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
NA
2010
13 years 3 months ago
2010
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...