129 search results - page 5 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
CONPAR
1992
13 years 11 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
ECML
2005
Springer
13 years 9 months ago
2005
Springer
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...