309 search results - page 33 / 62 » Updating Probabilities |
ICASSP
2010
IEEE
15 years 26 days ago
2010
IEEE
In this work, we look at single user and multiuser Multiple-Input Multiple-Output (MIMO) beamforming networks with Channel Distribution Information (CDI). CDI does not need to be ...
102
Voted
CSDA
2010
15 years 23 days ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
104
click to vote
COMPSEC
2004
15 years 16 days ago
2004
Identifying the intentions or attempts of the monitored agents through observations is very vital in computer network security. In this paper, a plan recognition method for predict...
128
Voted
UAI
1997
15 years 2 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
116
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...