Results 1  10
of
7,288
PAML: a program package for phylogenetic analysis by maximum likelihood
 COMPUT APPL BIOSCI 13:555–556
, 1997
"... PAML, currently in version 1.2, is a package of programs for phylogenetic analyses of DNA and protein sequences using the method of maximum likelihood (ML). The programs can be used for (i) maximum likelihood estimation of evolutionary parameters such as branch lengths in a phylogenetic tree, the tr ..."
Abstract

Cited by 1459 (17 self)
 Add to MetaCart
, the transition/transversion rate ratio, the shape parameter of the gamma distribution for variable evolutionary rates at sites, and rate parameters for different genes; (ii) likelihood ratio test of hypotheses concerning sequence evolution, such as rate constancy and independence among sites and rate constancy
Bayesian Network Classifiers
, 1997
"... Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with stateoftheart classifiers such as C4.5. This fact raises the question of whether a classifier with less restr ..."
Abstract

Cited by 796 (20 self)
 Add to MetaCart
restrictive assumptions can perform even better. In this paper we evaluate approaches for inducing classifiers from data, based on the theory of learning Bayesian networks. These networks are factored representations of probability distributions that generalize the naive Bayesian classifier and explicitly
Estimating dynamic models of imperfect competition
, 2007
"... We describe a twostep algorithm for estimating dynamic games under the assumption that behavior is consistent with Markov perfect equilibrium. In the first step, the policy functions and the law of motion for the state variables are estimated. In the second step, the remaining structural parameters ..."
Abstract

Cited by 279 (14 self)
 Add to MetaCart
and Pakes (1995) model. We test the algorithm on a class of dynamic discrete choice models with normally distributed errors and a class of dynamic oligopoly models similar to that of Pakes and McGuire (1994).
The robustness of test statistics to nonnormality and specification error in confirmatory factor analysis
 Psychological Methods
, 1996
"... Monte Carlo computer simulations were used to investigate the performance of three X 2 test statistics in confirmatory factor analysis (CFA). Normal theory maximum likelihood)~2 (ML), Browne's asymptotic distribution free X 2 (ADF), and the SatorraBentler rescaled X 2 (SB) were examined under ..."
Abstract

Cited by 230 (8 self)
 Add to MetaCart
Monte Carlo computer simulations were used to investigate the performance of three X 2 test statistics in confirmatory factor analysis (CFA). Normal theory maximum likelihood)~2 (ML), Browne's asymptotic distribution free X 2 (ADF), and the SatorraBentler rescaled X 2 (SB) were examined under
Geometric structures for threedimensional shape representation
 ACM Trans. Graph
, 1984
"... Different geometric structures are investigated in the context of discrete surface representation. It is shown that minimal representations (i.e., polyhedra) can be provided by a surfacebased method using nearest neighbors structures or by a volumebased method using the Delaunay triangulation. Bot ..."
Abstract

Cited by 194 (5 self)
 Add to MetaCart
. Both approaches are compared with respect to various criteria, such as space requirements, computation time, constraints on the distribution of the points, facilities for further calculations, and agreement with the actual shape of the object.
A Reliable Dissemination Protocol for Interactive Collaborative Applications
, 1995
"... The widespread availability of networked multimedia workstations and PCs has caused a significant interest in the use of collaborative multimedia applications. Examples of such applications include distributed shared whiteboards, group editors, and distributed games or simulations. Such applications ..."
Abstract

Cited by 235 (10 self)
 Add to MetaCart
. The control tree hierarchy employs restricted nacks with suppression and an expanding ring search to distribute the functions of state management and error recovery among many members, thereby allowing scalability to large numbers of receivers. An Mbonebased implementation of TMTP spanning the United States
Group reaction time distributions and an analysis of distribution statistics
 Psychological Bulletin
, 1979
"... A method of obtaining an average reaction time distribution for a group of subjects is described. The method is particularly useful for cases in which data from many subjects are available but there are only 1020 reaction time observations per subject cell. Essentially, reaction times for each subj ..."
Abstract

Cited by 196 (24 self)
 Add to MetaCart
distribution are much the same as average properties derived from the data of individual subjects. This article also examines how to quantitatively describe the shape of reaction time distributions. The use of moments and cumulants as sources of information about distribution shape is evaluated and rejected
Bayesian inference on phylogeny and its impact on evolutionary biology.
 Science
, 2001
"... 1 As a discipline, phylogenetics is becoming transformed by a flood of molecular data. These data allow broad questions to be asked about the history of life, but also present difficult statistical and computational problems. Bayesian inference of phylogeny brings a new perspective to a number of o ..."
Abstract

Cited by 235 (10 self)
 Add to MetaCart
is based on a quantity called the posterior probability of a tree (where the vertical bar should be read as "given") is used to combine the prior probability of a phylogeny (Pr[Tree]) with the likelihood (Pr[Data Խ Tree]) to produce a posterior probability distribution on trees (Pr[Tree Խ Data
Shape from Focus
, 1989
"... Rough surfaces pose a challenging shape extraction problem. Images of rough surfaces are often characterized by high frequency intensity variations, and it is difficult to perceive the shapes of these surfaces from their images. The shapefromfocus method de scribed in this paper uses different fo ..."
Abstract

Cited by 170 (6 self)
 Add to MetaCart
Rough surfaces pose a challenging shape extraction problem. Images of rough surfaces are often characterized by high frequency intensity variations, and it is difficult to perceive the shapes of these surfaces from their images. The shapefromfocus method de scribed in this paper uses different
Pathplanning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
 ALGORITHMICA
, 1987
"... The problem of path planning for an automaton moving in a twodimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is impos ..."
Abstract

Cited by 190 (3 self)
 Add to MetaCart
The problem of path planning for an automaton moving in a twodimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene
Results 1  10
of
7,288