Sciweavers

3341 search results - page 473 / 669
» On Bounded Queries and Approximation
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 6 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
EOR
2010
99views more  EOR 2010»
15 years 6 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or
FS
2006
84views more  FS 2006»
15 years 6 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
IM
2006
15 years 6 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
CVGIP
2007
136views more  CVGIP 2007»
15 years 6 months ago
Contour-based surface reconstruction using MPU implicit models
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
Ilya Braude, Jeffrey Marker, Ken Museth, Jonathan ...