2005 search results - page 232 / 401 » Decisive Markov Chains |
TIT
2002
15 years 1 months ago
2002
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
117
click to vote
PE
2007
Springer
15 years 1 months ago
2007
Springer
Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, ...
112
Voted
SAC
2008
ACM
15 years 1 months ago
2008
ACM
Standard methods for maximum likelihood parameter estimation in latent variable models rely on the Expectation-Maximization algorithm and its Monte Carlo variants. Our approach is ...
190
Voted
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
A Bayesian marked point process (MPP) model is developed
to detect and count people in crowded scenes. The
model couples a spatial stochastic process governing number
and placem...
CORR
2008
Springer
15 years 7 days ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...