Sciweavers

1118 search results - page 73 / 224
» Convex Optimization
Sort
View
159
Voted
TIT
2002
90views more  TIT 2002»
15 years 4 months ago
Optimal sequences for CDMA under colored noise: A Schur-saddle function property
We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We con...
Pramod Viswanath, Venkat Anantharam
TIP
2011
124views more  TIP 2011»
14 years 11 months ago
A Geometric Method for Optimal Design of Color Filter Arrays
—A color filter array (CFA) used in a digital camera is a mosaic of spectrally selective filters, which allows only one color component to be sensed at each pixel. The missing ...
Pengwei Hao, Yan Li, Zhouchen Lin, Eric Dubois
128
Voted
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
15 years 6 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
NA
2008
144views more  NA 2008»
15 years 4 months ago
Another hybrid conjugate gradient algorithm for unconstrained optimization
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
Neculai Andrei
UAI
2003
15 years 6 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen