32 search results - page 2 / 7 » On the Complexity of the Montes Ideal Factorization Algorith... |
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
This paper investigates a Bayesian model and a Markov chain Monte Carlo (MCMC) algorithm for gene factor analysis. Each sample in the dataset is decomposed as a linear combination...
ACG
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
JMLR
2010
13 years 3 days ago
2010
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Mo...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we propose a novel hybrid QRD-MCMC MIMO detector that combines the feature of a QRD-M detector and a Markov chain Monte Carlo (MCMC) detector. The QRD-M algorithm i...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...