155 search results - page 6 / 31 » Fast matrix rank algorithms and applications |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
116
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
128
click to vote
SIAMMAX
2010
14 years 4 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
111
click to vote
SIAMJO
2010
14 years 8 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
JACM
2011
14 years 4 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...