1982 search results - page 54 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
131
click to vote
FUIN
2008
15 years 2 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
118
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Choosing the appropriate sample size is an important step in the design of a microarray experiment, and recently methods have been proposed that estimate sample sizes ...
106
click to vote
UAI
2004
15 years 3 months ago
2004
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
107
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
127
click to vote
ILP
2003
Springer
15 years 7 months ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...