Sciweavers

3770 search results - page 361 / 754
» Building a Stochastic Dynamic Model of Application Use
Sort
View
APGV
2009
ACM
268views Visualization» more  APGV 2009»
15 years 10 months ago
Saliency maps of high dynamic range images
A number of computational models of visual attention have been proposed based on the concept of saliency map, most of them validated using oculometric data. They are widely used fo...
Josselin Petit, Roland Brémond, Jean-Philip...
CAIP
2009
Springer
202views Image Analysis» more  CAIP 2009»
15 years 4 months ago
Near-Regular Texture Synthesis
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
Michal Haindl, Martin Hatka
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
16 years 1 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
179
Voted
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 11 months ago
Q-learning and Pontryagin's Minimum Principle
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
Prashant G. Mehta, Sean P. Meyn

Publication
163views
14 years 2 months ago
Saliency Maps of High Dynamic Range Images
A number of computational models of visual attention have been proposed based on the concept of saliency map. Some of them have been validated as predictors of the visual scan-path...
Roland Brémond, Josselin Petit and Jean-Philippe...