Sciweavers

73 search results - page 10 / 15
» Fast Monte Carlo Algorithms for Permutation Groups
Sort
View
UAI
1996
13 years 8 months ago
Bayesian Learning of Loglinear Models for Neural Connectivity
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
Kathryn B. Laskey, Laura Martignon
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 1 months ago
QAM Codebooks for Low-Complexity Limited Feedback MIMO Beamforming
— This paper proposes a new QAM based codebook for beamforming in multiple-input multiple-output (MIMO) wireless systems with a limited-rate feedback channel. We show that such c...
Daniel J. Ryan, I. Vaughan, L. Clarkson, Iain B. C...
ISVC
2009
Springer
14 years 2 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
DSN
2007
IEEE
14 years 1 months ago
Variational Bayesian Approach for Interval Estimation of NHPP-Based Software Reliability Models
In this paper, we present a variational Bayesian (VB) approach to computing the interval estimates for nonhomogeneous Poisson process (NHPP) software reliability models. This appr...
Hiroyuki Okamura, Michael Grottke, Tadashi Dohi, K...