2694 search results - page 252 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
192
click to vote
CIMAGING
2009
15 years 7 months ago
2009
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
157
click to vote
ICASSP
2008
IEEE
16 years 28 days ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
154
click to vote
MP
2006
15 years 6 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
204
click to vote
ICS
1993
Tsinghua U.
15 years 10 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...