77 search results - page 15 / 16 » Exact Matrix Completion via Convex Optimization |
JMLR
2010
13 years 3 days ago
2010
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
ICQNM
2007
IEEE
13 years 11 months ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
COCO
2005
Springer
13 years 11 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
GLOBECOM
2009
IEEE
13 years 9 months ago
2009
IEEE
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
13 years 5 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...