12 search results - page 3 / 3 » Randomness vs. Time: De-Randomization under a Uniform Assump... |
129
Voted
SIROCCO
2008
15 years 5 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
163
Voted
CORR
2010
Springer
15 years 11 days ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...