515 search results - page 18 / 103 » Approximating Markov Processes by Averaging |
176
click to vote
VTC
2007
IEEE
16 years 7 days ago
2007
IEEE
—To approximate the exact peaks of continuous-time orthogonal frequency division multiplexing (OFDM) signals, four times oversampling is usually employed for discrete-time OFDM s...
167
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
153
click to vote
NIPS
2004
15 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
156
click to vote
LMCS
2006
15 years 6 months ago
2006
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
189
click to vote
ICASSP
2009
IEEE
16 years 22 days ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...