4 search results - page 1 / 1 » jacm 2011 |
JACM
2011
12 years 11 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...
JACM
2011
12 years 7 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
IACR
2011
12 years 4 months ago
2011
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...