1120 search results - page 90 / 224 » Eager Markov Chains |
131
click to vote
CSDA
2007
15 years 6 months ago
2007
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
153
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
We investigate explicit segment duration models in addressing the problem of fragmentation in musical audio segmentation. The resulting probabilistic models are optimised using Mar...
166
click to vote
PAMI
2008
15 years 6 months ago
2008
Segmentation and tracking of multiple humans in crowded situations is made difficult by interobject occlusion. We propose a model-based approach to interpret the image observations...
141
click to vote
IEICET
2007
15 years 6 months ago
2007
The IEEE 802.11 family of specifications is by far the most prominent and successful technique for accessing WLANs. Because the channel used by wireless devices is a time-varying...
143
click to vote
RSA
2006
15 years 6 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...