93 search results - page 1 / 19 » Fast Monte-Carlo Algorithms for Finding Low-Rank Approximati... |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
PCI
2001
Springer
13 years 9 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
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...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
JCC
2006
13 years 4 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...