389 search results - page 1 / 78 » Advances in Computation of the Maximum of a Set of Random Va... |
ISQED
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper quantifies the approximation error in Clark’s approach [1] to computing the maximum (max) of Gaussian random variables; a fundamental operation in statistical timing...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
TCBB
2008
13 years 4 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
Standard methods for maximum likelihood parameter estimation in latent variable models rely on the Expectation-Maximization algorithm and its Monte Carlo variants. Our approach is ...