Amanote Research
Register
Sign In
Budget-Optimal Crowdsourcing Using Low-Rank Matrix Approximations
doi 10.1109/allerton.2011.6120180
Full Text
Open PDF
Abstract
Available in
full text
Date
September 1, 2011
Authors
David R. Karger
Sewoong Oh
Devavrat Shah
Publisher
IEEE
Related search
Addressing High Dimensionality in Reliability Analysis Using Low-Rank Tensor Approximations
Frequency-Limited Balanced Truncation With Low-Rank Approximations
SIAM Journal of Scientific Computing
Computational Mathematics
Applied Mathematics
Low-Rank Matrix Completion by Riemannian Optimization
SIAM Journal on Optimization
Theoretical Computer Science
Software
S-Goodness for Low-Rank Matrix Recovery
Abstract and Applied Analysis
Applied Mathematics
Analysis
Uniqueness Conditions for Low-Rank Matrix Recovery
Efficient Preconditioning of Hp-Fem Matrices by Hierarchical Low-Rank Approximations
Journal of Scientific Computing
Numerical Analysis
Applied Mathematics
Computational Theory
Engineering
Computational Mathematics
Mathematics
Theoretical Computer Science
Software
Geometric Methods on Low-Rank Matrix and Tensor Manifolds
Proximal Iteratively Reweighted Algorithm for Low-Rank Matrix Recovery
Journal of Inequalities and Applications
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
Automatic Guide-Wire Detection for Neurointerventions Using Low-Rank Sparse Matrix Decomposition and Denoising
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
