Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

FOCS
1998
IEEE

favoriteEmaildiscussreport

90views Theoretical Computer Science» more FOCS 1998»

Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations

13 years 8 months ago

Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations

Download www-math.mit.edu

Alan M. Frieze, Ravi Kannan, Santosh Vempala

Real-time Traffic

FOCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» An Experimental Evaluation of a MonteCarlo Algorithm for Singular Value Decomposition

» Adaptive Sampling and Fast LowRank Matrix Approximation

» Fast computation of low rank matrix

» Using internal and collective variables in Monte Carlo simulations of nucleic acid structu...

» Monte Carlo Localization for Mobile Robots

» Reinforcement Learning in Continuous Action Spaces through Sequential Monte Carlo Methods

» MonteCarlo Sampling for NPHard Maximization Problems in the Framework of Weighted Parsing

» Variance reduction techniques for valueatrisk with heavytailed risk factors

» Fast Algorithms for Bayesian Uncertainty Quantification in LargeScale Linear Inverse Probl...

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Alan M. Frieze, Ravi Kannan, Santosh Vempala

Comments (0)