2957 search results - page 437 / 592 » The Complexity of Polynomial-Time Approximation |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the e...
CN
2006
13 years 10 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
EOR
2006
13 years 10 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
CGF
2007
13 years 10 months ago
2007
The recent soft shadow mapping technique [GBP06] allows the rendering in real-time of convincing soft shadows on complex and dynamic scenes using a single shadow map. While attrac...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...