text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
called loci. also depend phenotypes, genomic often Complex quantitative traits, on multiple which are
Complex phenotypes, which are also called quantitative traits, often depend on multiple genomic loci.
5,700
the and evolution We populations. derive approximate across distribution of for within equations phenotype values
We derive approximate evolution equations for the distribution of phenotype values within and across populations.
5,701
evolutionary the processes. We our the of implications for predictability discuss of findings
We discuss the implications of our findings for the predictability of evolutionary processes.
5,702
we learning decision-tree consider two particular, In algorithms.
In particular, we consider two decision-tree learning algorithms.
5,703
formulated as present influence solution new a to problems approach the decision We of diagrams.
We present a new approach to the solution of decision problems formulated as influence diagrams.
5,704
paper, RC. three we this key of present extensions In
In this paper, we present three key extensions of RC.
5,705
We interpretation Entropy Principle terms. the game-theoretic (MaxEnt) Maximum an in of give
We give an interpretation of the Maximum Entropy (MaxEnt) Principle in game-theoretic terms.
5,706
many to avoid allows problem this distinction cases. us in Our
Our distinction allows us to avoid this problem in many cases.
5,707
in theorems characterization presetned are main paper. Their this
Their main characterization theorems are presetned in this paper.
5,708
scales an map is Finally, integrated information multiple by rule. final saliency the maximization across
Finally, across multiple scales is integrated the final saliency map by an information maximization rule.
5,709
in The approach several appealing decomposition is ways.
The decomposition approach is appealing in several ways.
5,710
constraints propagation be challenging. because for can very a designing complex algorithm Secondly,
Secondly, because designing a propagation algorithm for complex constraints can be very challenging.
5,711
can Probabilities most in is to the natural expert. the specified direction be that domain
Probabilities can be specified in the direction that is most natural to the domain expert.
5,712
networks. knowledge knowledge removes Thus, traditional the acquisition of bottleneck acquisition efficiently Bayesian the
Thus, the knowledge acquisition efficiently removes the traditional knowledge acquisition bottleneck of Bayesian networks.
5,713
same shown strictly is normal multivariate for hold The also result distributions. positive to
The same result is shown to hold also for multivariate strictly positive normal distributions.
5,714
inference. speeding we this paper, evidence-specific value for Bayesian In abstraction networks use
In this paper, we use evidence-specific value abstraction for speeding Bayesian networks inference.
5,715
is procedure many learning useful for complex variables. Our networks with particularly hidden
Our procedure is particularly useful for learning complex networks with many hidden variables.
5,716
are In EM parameter repeated optimization other cases, such likelihood required or techniques. for computations
In such cases, repeated likelihood computations are required for EM or other parameter optimization techniques.
5,717
handwriting Arabic offline this we recognition. address word problem of paper the In
In this paper we address the problem of offline Arabic handwriting word recognition.
5,718
cut First, the several image blocks. in we
First, we cut the image in several blocks.
5,719
vector compute block, For of a each we descriptors.
For each block, we compute a vector of descriptors.
5,720
the Then, moments. we Zernik including K-means cluster to use features low-level Hu and
Then, we use K-means to cluster the low-level features including Zernik and Hu moments.
5,721
recognition FAN DBN demonstrate results outperform rates and good The .
The results demonstrate FAN and DBN outperform good recognition rates .
5,722
constraint reasoning a and probabilistic reasoning. document between We connection
We document a connection between constraint reasoning and probabilistic reasoning.
5,723
discuss methods. briefly some empirical We and related results,
We briefly discuss some empirical results, and related methods.
5,724
a information perspective. partial Planning agents decision- theoretic state distributed considered from with is for
Planning for distributed agents with partial state information is considered from a decision- theoretic perspective.
5,725
control. models of allow for decentralized We generalizations the and MDP both describe that POMDP
We describe generalizations of both the MDP and POMDP models that allow for decentralized control.
5,726
Markov These and between control results a of illustrate decentralized difference fundamental centralized processes. complexity
These complexity results illustrate a fundamental difference between centralized and decentralized control of Markov processes.
5,727
models require expansion. Such and analysis, adaptation application
Such models require application analysis, adaptation and expansion.
5,728
derived from To present evaluate application our real-world data. approach, models we usage
To evaluate our approach, we present models derived from real-world application usage data.
5,729
by designed peptide al. was Loose et This earlier
This peptide was earlier designed by Loose et al.
5,730
linguistic of peptides. antimicrobial using model natural a
using a linguistic model of natural antimicrobial peptides.
5,731
employed commonly operator used This an can strategies. as to search extension be
This operator can be used as an extension to commonly employed search strategies.
5,732
artificial in and evaluated real-world It is with experiments data.
It is evaluated in experiments with artificial and real-world data.
5,733
compositional and serial with parallel paper objects models multiple part This describes sharing. of
This paper describes serial and parallel compositional models of multiple objects with part sharing.
5,734
executive an which yield sizes on are lattices parts represented summary These of decreasing description.
These parts are represented on lattices of decreasing sizes which yield an executive summary description.
5,735
and learning algorithms for these models. inference describe We
We describe inference and learning algorithms for these models.
5,736
acyclic for paper This measures associated probability independence of sets directed graphs. with analyzes concepts
This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs.
5,737
separation and Markov independence paper epistemic standard the The violate condition shows that properties. desirable
The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties.
5,738
proposed, independence. To on epistemic condition strong this situation, overcome unsatisfactory is Markov based a
To overcome this unsatisfactory situation, a strong Markov condition is proposed, based on epistemic independence.
5,739
discussed is sources information this The setting. in of multiple fusion
The fusion of multiple sources information is discussed in this setting.
5,740
considered of including are merging reinforcement, and classes adaptive conjunctive, operators. operators averaging Different disjunctive,
Different classes of merging operators are considered including conjunctive, disjunctive, reinforcement, adaptive and averaging operators.
5,741
postulates. propose we Then terms classes of in to these analyse
Then we propose to analyse these classes in terms of postulates.
5,742
under plan-generation stochastic a of Techniques for recognition model uncertainty require the process. plan
Techniques for plan recognition under uncertainty require a stochastic model of the plan-generation process.
5,743
plan-generation State-Dependent an introduce (PSDGs) Probabilistic agent's process. Grammars We to represent
We introduce Probabilistic State-Dependent Grammars (PSDGs) to represent an agent's plan-generation process.
5,744
This hold anymore result, does for Bayesian however, not general networks.
This result, however, does not hold anymore for general Bayesian networks.
5,745
sequentially. thus are entropy which We models, kind new maximum computed of present a
We thus present a new kind of maximum entropy models, which are computed sequentially.
5,746
a the encodes only As basic drawback, structures. dictionary
As a drawback, the dictionary only encodes basic structures.
5,747
magneto- is This instance, or case, the (M/EEG). for multi-trial electroencephalography in
This is the case, for instance, in multi-trial magneto- or electroencephalography (M/EEG).
5,748
simulated on is neuroelectric method The and data. validated real
The method is validated on simulated and real neuroelectric data.
5,749
are interpretations. on Belief many-valued distributions modeled all the states possibility by set of
Belief states are modeled by possibility distributions on the set of all many-valued interpretations.
5,750
lineages Phylogeographic studies multiple reveal species. morphologically-cryptic within frequently
Phylogeographic studies frequently reveal multiple morphologically-cryptic lineages within species.
5,751
yet What lineages whether such evolutionary nascent or unclear is is species represent ephemera.
What is yet unclear is whether such lineages represent nascent species or evolutionary ephemera.
5,752
vehicle become Monte Bayesian a has inference in major sampling Carlo approximate for networks.
Monte Carlo sampling has become a major vehicle for approximate inference in Bayesian networks.
5,753
selecting for sequence. for Sobol numbers an We propose direction algorithm
We propose an algorithm for selecting direction numbers for Sobol sequence.
5,754
for (nHDP) process a Dirichlet develop topic We modeling. nested hierarchical hierarchical
We develop a nested hierarchical Dirichlet process (nHDP) for hierarchical topic modeling.
5,755
nature the of procedure. non-random beliefs the priors include The sampling about
The priors include beliefs about the nature of the non-random sampling procedure.
5,756
uncetainties Conversations with various kinds. of abound
Conversations abound with uncetainties of various kinds.
5,757
compared tree propagation. a speed-up experimental indicating to junction traditional results present We substantial
We present experimental results indicating a substantial speed-up compared to traditional junction tree propagation.
5,758
this Prolog described. is implementation for A
A Prolog implementation for this is described.
5,759
representations the We of discuss constructing also possibility the explicit of posterior.
We also discuss the possibility of constructing explicit representations of the posterior.
5,760
public is a in health problem countries. main Malnutrition developing
Malnutrition is a main public health problem in developing countries.
5,761
and the is high. still rate mortality increasing Incidence is
Incidence is increasing and the mortality rate is still high.
5,762
The was lactation. a food to rat competition model applied during malnutrition provoke method to
The food competition method was applied to a rat model to provoke malnutrition during lactation.
5,763
plenty delayed increase weight is available. milk is even if there The
The weight increase is delayed even if there is plenty milk available.
5,764
can using a large network. dynamic MDPs be compactly represented Bayesian Many
Many large MDPs can be represented compactly using a dynamic Bayesian network.
5,765
type policy improvement. of ill-suited is This weighted projection to
This type of weighted projection is ill-suited to policy improvement.
5,766
process. this use a iteration then algorithm value policy in as subroutine We a determination
We then use this value determination algorithm as a subroutine in a policy iteration process.
5,767
probabilistic a have in networks reasoning Qualitative been designed for probabilistic qualitative way.
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way.
5,768
an insightful more present unresolved algorithm We computing for results trade-offs. for
We present an algorithm for computing more insightful results for unresolved trade-offs.
5,769
compute paper topological This a rules. automatically to SWRL presents relations using method
This paper presents a method to compute automatically topological relations using SWRL rules.
5,770
instance, "RailStation". that "Railway" a For a a overlaps is "Building"
For instance, a "Building" that overlaps a "Railway" is a "RailStation".
5,771
aid of analysis Three steps selection. in the
Three steps aid in the analysis of selection.
5,772
by their component causes. First, describe phenotypes
First, describe phenotypes by their component causes.
5,773
terms models. evolutionary and Traditionally, those of the by given components regression covariance, are variance,
Traditionally, those components are given by the covariance, variance, and regression terms of evolutionary models.
5,774
those I information interpret show to how with theory. to statistical expressions respect
I show how to interpret those statistical expressions with respect to information theory.
5,775
applications. object challenging a a an task video multimedia is of in Segmentation from
Segmentation of an object from a video is a challenging task in multimedia applications.
5,776
video problem efficiency. segmentation address the paper, from In the we this of perspective of
In this paper, we address the problem of video segmentation from the perspective of efficiency.
5,777
interactive scenarios. These automatic for both are segmentation experimented video improvements and
These improvements are experimented for both automatic and interactive video segmentation scenarios.
5,778
quality addition is tested in both segmentation the Moreover, quantitatively qualitatively. also efficiency, to and
Moreover, in addition to the efficiency, segmentation quality is also tested both quantitatively and qualitatively.
5,779
segmentation Indeed, is examples, quality. efficiency for some without observed of loss challenging time significant
Indeed, for some challenging examples, significant time efficiency is observed without loss of segmentation quality.
5,780
high-quality, assembly of data However, sequences challenging. into finished remains such genome
However, assembly of such data into high-quality, finished genome sequences remains challenging.
5,781
intended to assembly. methods genome are assess Assemblathon The in current competitions state-of-the-art
The Assemblathon competitions are intended to assess current state-of-the-art methods in genome assembly.
5,782
of one of daily important most communication. means Handwriting is the
Handwriting is one of the most important means of daily communication.
5,783
proposed (ESR) successfully. sentence system tested and approach recognition English The is designed
The proposed approach English sentence recognition (ESR) system is designed and tested successfully.
5,784
the Experimental higher were that accuracy speed show examined. results and
Experimental results show that the higher speed and accuracy were examined.
5,785
ligand in binding. chain factor important an flexibility is Side
Side chain flexibility is an important factor in ligand binding.
5,786
implemented This in FlexAID. the is software approach tool
This approach is implemented in the software tool FlexAID.
5,787
for need system automatic lip-reading is an increasing. The ever
The need for an automatic lip-reading system is ever increasing.
5,788
In special addition, people imperative needs. visual is with information among
In addition, visual information is imperative among people with special needs.
5,789
presented. a detection is of language the approach ontology using objects Thus, knowledge-based OWL
Thus, a knowledge-based detection approach of objects using the OWL ontology language is presented.
5,790
rules. to detection SWRL define This knowledge used is
This knowledge is used to define SWRL detection rules.
5,791
this the paper examines models. mathematical of using dynamics system, evolutionary This
This paper examines the evolutionary dynamics of this system, using mathematical models.
5,792
are and extinction Implications avoid required to conditions discussed.
Implications and conditions required to avoid extinction are discussed.
5,793
Experimental tests are model this for suggested.
Experimental tests for this model are suggested.
5,794
a well-suited Poker's unique challenge in research artificial for Computer characteristics present intelligence.
Computer Poker's unique characteristics present a well-suited challenge for research in artificial intelligence.
5,795
diseases. antibiotic of ability bacteria continued resistance treat The our evolution infectious to among threatens
The evolution of antibiotic resistance among bacteria threatens our continued ability to treat infectious diseases.
5,796
bacterial sustainable never for need The has strategies cure infections been greater. to
The need for sustainable strategies to cure bacterial infections has never been greater.
5,797
for may We results resistance. a framework anticipate conceptual these that antibiotic provide managing
We anticipate that these results may provide a conceptual framework for managing antibiotic resistance.
5,798
key the the presented of is idea perception subjective of The reality. model idea
The key idea of the presented perception model is the idea of subjective reality.
5,799