59 search results - page 1 / 12 » Analysis of greedy approximations with nonsubmodular potenti... |
SODA
2008
ACM
13 years 5 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
SODA
2008
ACM
13 years 5 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
JSAC
2010
13 years 2 months ago
2010
Abstract—Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. Such platforms use inertial information of their...