3874 search results - page 342 / 775 » Approximation Algorithms for k-hurdle Problems |
222
Voted
IPL
2006
15 years 5 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
140
click to vote
NIPS
2008
15 years 6 months ago
2008
We show how improved sequences for magnetic resonance imaging can be found through optimization of Bayesian design scores. Combining approximate Bayesian inference and natural ima...
124
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
112
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
137
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...