Sciweavers

2040 search results - page 98 / 408
» Approximate Expectation Maximization
Sort
View
DCG
2000
104views more  DCG 2000»
15 years 2 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
CORR
2010
Springer
170views Education» more  CORR 2010»
15 years 3 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
TOMACS
2010
79views more  TOMACS 2010»
14 years 9 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu
ICPR
2000
IEEE
16 years 4 months ago
A Cluster Grouping Technique for Texture Segmentation
We propose an algorithm for texture segmentation based on a divide-and-conquerstrategy of statistical modeling.Selectedsets of Gaussianclusters,estimated via ExpectationMaximizati...
Roberto Manduchi
IPMU
2010
Springer
15 years 7 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin