3894 search results - page 349 / 779 » Approximation Algorithms for Biclustering Problems |
157
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
234
click to vote
IPL
2006
15 years 6 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...
153
Voted
NIPS
2008
15 years 7 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...
142
click to vote
ICASSP
2011
IEEE
14 years 10 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 ...
128
click to vote
CORR
2008
Springer
15 years 6 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...