2520 search results - page 255 / 504 » The complexity of approximating entropy |
159
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
187
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
159
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
138
click to vote
ISCAS
2008
IEEE
16 years 1 months ago
2008
IEEE
— An accurate and efficient solution for the transient response at the far end of a transmission line is proposed in this paper. Unlike approximating the poles by truncating the...
165
click to vote
CISS
2007
IEEE
16 years 29 days ago
2007
IEEE
— In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshol...