19 search results - page 2 / 4 » Low-rank matrix completion with geometric performance guaran... |
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...
SIAMJO
2010
13 years 3 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- Stateless geographic routing provides relatively good performance at a fixed overhead, which is typically much lower than conventional routing protocols such as AODV. Ho...
JMLR
2010
13 years 5 days ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...