8 search results - page 1 / 2 » SRF: Matrix completion based on smoothed rank function |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...