Sciweavers

276 search results - page 49 / 56
» Global Optimization of Probabilistically Constrained Linear ...
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 6 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
INFOCOM
2011
IEEE
12 years 11 months ago
A dynamic relay selection scheme for mobile users in wireless relay networks
—Cooperative communication has attracted dramatic attention in the last few years due to its advantage in mitigating channel fading. Despite much effort that has been made in the...
Yifan Li, Ping Wang, Dusit Niyato, Weihua Zhuang
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
IJRR
2008
139views more  IJRR 2008»
13 years 8 months ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 2 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...