Sciweavers

347 search results - page 21 / 70
» Markov Chain Monte Carlo
Sort
View
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 8 months ago
Dynamic Data Driven Simulations in Stochastic Environments
To improve the predictions in dynamic data driven simulations (DDDAS) for subsurface problems, we propose the permeability update based on observed measurements. Based on measurem...
Craig C. Douglas, Yalchin Efendiev, Richard E. Ewi...
CSDA
2007
94views more  CSDA 2007»
13 years 8 months ago
Some extensions of score matching
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...
Aapo Hyvärinen
ML
2006
ACM
13 years 8 months ago
Using duration models to reduce fragmentation in audio segmentation
We investigate explicit segment duration models in addressing the problem of fragmentation in musical audio segmentation. The resulting probabilistic models are optimised using Mar...
Samer A. Abdallah, Mark B. Sandler, Christophe Rho...
PAMI
2008
188views more  PAMI 2008»
13 years 8 months ago
Segmentation and Tracking of Multiple Humans in Crowded Environments
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...
Tao Zhao, Ramakant Nevatia, Bo Wu
TWC
2008
107views more  TWC 2008»
13 years 8 months ago
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...