6315 search results - page 126 / 1263 » Approximating Solution Structure |
188
click to vote
NIPS
2001
15 years 7 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
122
click to vote
MOC
1998
15 years 6 months ago
1998
Abstract. We present formulations of the Trotter-Kato theorem for approximation of linear C0-semigroups which provide very useful framework when convergence of numerical approximat...
201
click to vote
JMLR
2010
15 years 1 months ago
2010
We present an approximate inference approach to parameter estimation in a spatio-temporal stochastic process of the reaction-diffusion type. The continuous space limit of an infer...
170
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
195
click to vote
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...