The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitations, a significant one being variation in eventual solutions found, due to convergence to local optima. Several techniques have been proposed to allay this problem, for example… (More)
In 2009, an average American spent 3 hours per day watching TV. Recent advances in TV entertainment technologies, such as on-demand content, browsing the Internet, and 3D displays, have changed the traditional role of the TV and turned it into the center of home entertainment. Most of these technologies are personal and would benefit from seamless… (More)
Research Interests Probabilistic models for natural language processing, statistical machine translation, large-scale data processing, machine learning.
is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In the light of generalized metric space given by Mustafa and Sims , and soft set given by D. Molodtsov , we introduce the notion of… (More)
In this paper, we introduced an iterative method for approximating a fixed point of asymptotically non-expansive map-pings in the intermediate sense in a uniformly convex Banach space. We establish some strong and weak convergence theorems.
In this paper, we construct Ishikawa iteration scheme with error for nonself I-quasi nonexpansive maps and establish the weak convergence of a sequence of Ishikawa iteration of nonself I-quasi nonexpansive maps in a Banach space which satisfies Opial's condition.