Sciweavers

354 search results - page 39 / 71
» Approximate Option Pricing
Sort
View
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
13 years 9 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
SGP
2007
13 years 10 months ago
Data-dependent MLS for faithful surface approximation
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
Yaron Lipman, Daniel Cohen-Or, David Levin
ICCS
2007
Springer
13 years 11 months ago
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Abstract. Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price f...
Nargess Memarsadeghi, David M. Mount
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 2 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre
JAIR
2000
152views more  JAIR 2000»
13 years 7 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht