1318 search results - page 186 / 264 » Aggregation-based model reduction of a Hidden Markov Model |
155
click to vote
JMLR
2010
14 years 11 months ago
2010
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
136
click to vote
PERCOM
2007
ACM
16 years 4 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
174
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by...
120
click to vote
SIGIR
2005
ACM
15 years 10 months ago
2005
ACM
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
166
click to vote
TCBB
2011
14 years 11 months ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...