2814 search results - page 93 / 563 » Competitive Analysis of Distributed Algorithms |
155
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...
120
click to vote
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We present a new method for the simultaneous, nearly automatic segmentation of liver contours, vessels, and metastatic lesions from abdominal CTA scans. The method repeat...
106
click to vote
CSDA
2006
15 years 2 months ago
2006
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
130
click to vote
SAT
2010
Springer
15 years 19 days ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
129
click to vote
CC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...