in this paper, the ambiguity of nite state irreducible markov chain trajectories is reminded and is obtained for two state markov chain. i give an applicable example of this concept in president election

with recent developments in communication technologies, it is possible to access information any time and in any place; however, mobile environments bring forward certain requirements and exclusive challenges including low connection speeds and bandwidth limitations. thus, we need to consider mobile limitations when using web services. providing services and limited resource allocation to users...

In this work, we present the first results for neuralizing an Unsupervised Hidden Markov Model. We evaluate our approach on tag induction. Our approach outperforms existing generative models and is competitive with the state-of-the-art though with a simpler model easily extended to include additional context.

In this paper we propose a two-stage, supervised statistical model for detecting the activities of daily living (ADL) from sensor data streams. In the first stage each activity is modeled separately by a Markov model where sensors correspond to states. By modeling each sensor as a state we capture the absolute and relational temporal features of the atomic activities. A novel data segmentation ...

In this paper, we describe a statistical method to detect highlights in a baseball game video. The input video is first segmented into scene shots, within which the camera motion is continuous. Our approach is based on the observations that 1) most highlights in baseball games are composed of certain types of scene shots and 2) those scene shots exhibit special transition context in time. To ex...

In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...