3038 search results - page 204 / 608 » High-Speed Function Approximation |
178
click to vote
JMLR
2012
13 years 9 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
160
click to vote
JDA
2011
15 years 1 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
187
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
157
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a new method for calculating a tight approximation to the distribution of the sum of independent lognormal random variables. We make use of a three
135
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...