Results 1  10
of
68,240
Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods
 J. Mol. Evol
, 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract

Cited by 557 (29 self)
 Add to MetaCart
Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called
Tutorial on Variational Approximation Methods
 IN ADVANCED MEAN FIELD METHODS: THEORY AND PRACTICE
, 2000
"... We provide an introduction to the theory and use of variational methods for inference and estimation in the context of graphical models. Variational methods become useful as ecient approximate methods when the structure of the graph model no longer admits feasible exact probabilistic calculations. T ..."
Abstract

Cited by 88 (1 self)
 Add to MetaCart
We provide an introduction to the theory and use of variational methods for inference and estimation in the context of graphical models. Variational methods become useful as ecient approximate methods when the structure of the graph model no longer admits feasible exact probabilistic calculations
Approximation Methods
, 1990
"... In this paper we take a new look at numerical techniques for solving parabolic equations by the method of lines. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action o ..."
Abstract
 Add to MetaCart
In this paper we take a new look at numerical techniques for solving parabolic equations by the method of lines. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action
Approximating Methods for
"... This thesis investigates various methods for carrying out approximate inference in intractable probabilistic models. By capturing the relationships between random variables, the framework of graphical models hints at which sets of random variables pose a problem to the inferential step. The approxim ..."
Abstract
 Add to MetaCart
This thesis investigates various methods for carrying out approximate inference in intractable probabilistic models. By capturing the relationships between random variables, the framework of graphical models hints at which sets of random variables pose a problem to the inferential step
Approximate methods
"... Figure 1: Encoding extreme colors. Left to right: original (48 bpp), our method (8 bpp), DXTCencoded RGBE (12 bpp), and our method with less bits for color (see 3.2). The intensity of the red illumination brings out the artifacts resulting from low color resolution. We present a novel compression s ..."
Abstract
 Add to MetaCart
Figure 1: Encoding extreme colors. Left to right: original (48 bpp), our method (8 bpp), DXTCencoded RGBE (12 bpp), and our method with less bits for color (see 3.2). The intensity of the red illumination brings out the artifacts resulting from low color resolution. We present a novel compression
Approximate methods
"... An image compression method using the wavelet transform, zero tree coding and adaptive arithmetic coding has been proposed. Here a novel static zeroth order adaptive arithmetic coder is being explored to improve the compression ratio. The proposed method decomposes an image into several subband imag ..."
Abstract
 Add to MetaCart
An image compression method using the wavelet transform, zero tree coding and adaptive arithmetic coding has been proposed. Here a novel static zeroth order adaptive arithmetic coder is being explored to improve the compression ratio. The proposed method decomposes an image into several subband
Approximation Methods
, 2005
"... Technical Memorandum NMFS series to issue informal scientific and technical publications when complete formal review and editorial processing are not appropriate or feasible due to time constraints. Documents published in this series may be referenced in the scientific and technical literature. The ..."
Abstract
 Add to MetaCart
Technical Memorandum NMFS series to issue informal scientific and technical publications when complete formal review and editorial processing are not appropriate or feasible due to time constraints. Documents published in this series may be referenced in the scientific and technical literature. The NMFSNWFSC Technical Memorandum series of the Northwest Fisheries Science Center continues the NMFSF/NWC series established in 1970 by the Northwest & Alaska Fisheries Science Center, which has since been split into the Northwest Fisheries
Approximating discrete probability distributions with dependence trees
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1968
"... A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n variables ..."
Abstract

Cited by 881 (0 self)
 Add to MetaCart
A method is presented to approximate optimally an ndimensional discrete probability distribution by a product of secondorder distributions, or the distribution of the firstorder tree dependence. The problem is to find an optimum set of n1 first order dependence relationship among the n
Greedy Function Approximation: A Gradient Boosting Machine
 Annals of Statistics
, 2000
"... Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additi ..."
Abstract

Cited by 1000 (13 self)
 Add to MetaCart
Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed
Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms
 IEEE Transactions on Information Theory
, 2005
"... Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems t ..."
Abstract

Cited by 585 (13 self)
 Add to MetaCart
the Bethe approximation, and corresponding generalized belief propagation (GBP) algorithms. We emphasize the conditions a free energy approximation must satisfy in order to be a “valid ” or “maxentnormal ” approximation. We describe the relationship between four different methods that can be used
Results 1  10
of
68,240