Results 1  10
of
9,153
A comparison of bayesian methods for haplotype reconstruction from population genotype data.
 Am J Hum Genet
, 2003
"... In this report, we compare and contrast three previously published Bayesian methods for inferring haplotypes from genotype data in a population sample. We review the methods, emphasizing the differences between them in terms of both the models ("priors") they use and the computational str ..."
Abstract

Cited by 557 (7 self)
 Add to MetaCart
In this report, we compare and contrast three previously published Bayesian methods for inferring haplotypes from genotype data in a population sample. We review the methods, emphasizing the differences between them in terms of both the models ("priors") they use and the computational
A fast and flexible statistical model for largescale population genotype data: Applications to inferring missing genotypes and haplotype phase
 American Journal of Human Genetics
, 2005
"... We present a statistical model for patterns of genetic variation in samples of unrelated individuals from natural populations. This model is based on the idea that, over short regions, haplotypes in a population tend to cluster into groups of similar haplotypes. To capture the fact that, because of ..."
Abstract

Cited by 408 (10 self)
 Add to MetaCart
missing genotypes and estimating haplotypic phase. For imputing missing genotypes, methods based on this model are as accurate or more accurate than existing methods. For haplotype estimation, the point estimates are slightly less accurate than those from the best existing methods (e.g., for unrelated
Image analogies
, 2001
"... Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The fullsize images are shown in Figures 10 and 11. This paper describes a new framewo ..."
Abstract

Cited by 455 (8 self)
 Add to MetaCart
framework for processing images by example, called “image analogies. ” The framework involves two stages: a design phase, in which a pair of images, with one image purported to be a “filtered ” version of the other, is presented as “training data”; and an application phase, in which the learned filter
Characterizing the Internet hierarchy from multiple vantage points
 IN PROC. IEEE INFOCOM
, 2002
"... The delivery of IP traffic through the Internet depends on the complex interactions between thousands of autonomous systems (ASes) that exchange routing information using the Border Gateway Protocol (BGP). This paper investigates the topological structure of the Internet in terms of customerprovide ..."
Abstract

Cited by 384 (19 self)
 Add to MetaCart
provider and peerpeer relationships between ASes, as manifested in BGP routing policies. We describe a technique for inferring AS relationships by exploiting partial views of the AS graph available from different vantage points. Next we apply the technique to a collection of ten BGP routing tables to infer
Visibility Preprocessing For Interactive Walkthroughs
 IN: COMPUTER GRAPHICS (SIGGRAPH 91 PROCEEDINGS
, 1991
"... The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a small fraction of atypical model is visible from most viewpoints. We describe a method of visibility pre ..."
Abstract

Cited by 332 (16 self)
 Add to MetaCart
nfthesubdivisicm. Next. theccl/r/~cc/ / visibility is computed for each cell of the subdivisirrn, by linking pairs of cells between which unobstructed.si,q/~t/inr. ~exist. During an interactive ww/krhrm/,q/~phase, an observer with a known ~~sition and\it)M~~~)~t>mov esthrc>ughthe model. At each frame
Developments in the Measurement of Subjective WellBeing
 Psychological Science.
, 1993
"... F or good reasons, economists have had a longstanding preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract

Cited by 284 (7 self)
 Add to MetaCart
of others and depart from the standard model of the rational economic agent in other ways. If people display bounded rationality when it comes to maximizing utility, then their choices do not necessarily reflect their "true" preferences, and an exclusive reliance on choices to infer what people
Population structure and eigenanalysis
 PLoS Genet 2(12): e190 DOI: 10.1371/journal.pgen.0020190
, 2006
"... Current methods for inferring population structure from genetic data do not provide formal significance tests for population differentiation. We discuss an approach to studying population structure (principal components analysis) that was first applied to genetic data by CavalliSforza and colleague ..."
Abstract

Cited by 263 (9 self)
 Add to MetaCart
Current methods for inferring population structure from genetic data do not provide formal significance tests for population differentiation. We discuss an approach to studying population structure (principal components analysis) that was first applied to genetic data by Cavalli
The induction of dynamical recognizers
 Machine Learning
, 1991
"... A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the le ..."
Abstract

Cited by 225 (14 self)
 Add to MetaCart
of the learning process illustrates a new form of mechanical inference: Induction by phase transition. A small weight adjustment causes a "bifurcation" in the limit behavior of the network. This phase transition corresponds to the onset of the network’s capacity for generalizing to arbitrary
Efficient learning of sparse representations with an energybased model
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS (NIPS 2006
, 2006
"... We describe a novel unsupervised method for learning sparse, overcomplete features. The model uses a linear encoder, and a linear decoder preceded by a sparsifying nonlinearity that turns a code vector into a quasibinary sparse code vector. Given an input, the optimal code minimizes the distance b ..."
Abstract

Cited by 219 (15 self)
 Add to MetaCart
between the output of the decoder and the input patch while being as similar as possible to the encoder output. Learning proceeds in a twophase EMlike fashion: (1) compute the minimumenergy code vector, (2) adjust the parameters of the encoder and decoder so as to decrease the energy. The model
A general algorithm for calculating jet cross sections in
 NLO QCD,” Nucl. Phys. B
, 1997
"... We present a new general algorithm for calculating arbitrary jet cross sections in arbitrary scattering processes to nexttoleading accuracy in perturbative QCD. The algorithm is based on the subtraction method. The key ingredients are new factorization formulae, called dipole formulae, which imple ..."
Abstract

Cited by 195 (3 self)
 Add to MetaCart
We present a new general algorithm for calculating arbitrary jet cross sections in arbitrary scattering processes to nexttoleading accuracy in perturbative QCD. The algorithm is based on the subtraction method. The key ingredients are new factorization formulae, called dipole formulae, which
Results 1  10
of
9,153