1059 search results - page 36 / 212 » Improved Algorithms via Approximations of Probability Distri... |
120
Voted
NIPS
2008
15 years 5 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
152
Voted
WWW
2011
ACM
14 years 10 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
154
Voted
UAI
2001
15 years 5 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
180
Voted
STACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
110
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Wise et al. introduced a rank-based statistical technique for meta-analysis of genome scans, the Genome Scan Meta-Analysis (GSMA) method. Levinson et al. recently desc...