Sciweavers

451 search results - page 24 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
NPAR
2000
ACM
14 years 9 days ago
An algorithm for automatic painterly rendering based on local source image approximation
This paper presents a new method for the automatic painterly rendering. This method synthesizes an impressive image with a handcrafted look from a source image such as a photograp...
Michio Shiraishi, Yasushi Yamaguchi
ICML
2009
IEEE
14 years 9 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
ICCV
2007
IEEE
14 years 10 months ago
Multiscale Edge Detection and Fiber Enhancement Using Differences of Oriented Means
We present an algorithm for edge detection suitable for both natural as well as noisy images. Our method is based on efficient multiscale utilization of elongated filters measurin...
Meirav Galun, Ronen Basri, Achi Brandt
SIGPRO
2010
73views more  SIGPRO 2010»
13 years 7 months ago
Continuous-time and continuous-discrete-time unscented Rauch-Tung-Striebel smoothers
This article considers the application of the unscented transformation to approximate fixed-interval optimal smoothing of continuous-time non-linear stochastic systems. The propo...
Simo Särkkä
EOR
2006
103views more  EOR 2006»
13 years 8 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...