text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
can be this networks. through The paper theory achieved shows of how the credal
The paper shows how this can be achieved through the theory of credal networks.
4,800
The with work to existing can algorithm this representation. be adapted
The existing algorithm can be adapted to work with this representation.
4,801
to apply multiagent allows methods formulation us our also settings. to This collaborative
This formulation also allows us to apply our methods to collaborative multiagent settings.
4,802
genuine a class theories. converge two trends probability to show of these We
We show these two trends converge to a class of genuine probability theories.
4,803
the model samples. only death the identified large If for unknown, probability can be is
If the death probability is unknown, the model can be identified only for large samples.
4,804
We consider decision of computing the policies optimal processes. problem Markov relational for generalised
We consider the problem of computing optimal generalised policies for relational Markov decision processes.
4,805
consider of the data. estimating underlying sample of distribution We the problem observed an
We consider the problem of estimating the distribution underlying an observed sample of data.
4,806
symbolic probability paper generalization This theory a decision for proposes theory a (SP). of
This paper proposes a decision theory for a symbolic generalization of probability theory (SP).
4,807
a interpretation elicitation. useful because subjective the uncertainty for provides It basis is
It is useful because the subjective interpretation provides a basis for uncertainty elicitation.
4,808
potentials utility used be can MTE functions. Also, approximate to
Also, MTE potentials can be used to approximate utility functions.
4,809
variable MTE are by solved elimination diagrams using fusion influence algorithm. a
MTE influence diagrams are solved by variable elimination using a fusion algorithm.
4,810
evaluating and to Most for comparing approaches these problems. testbed a importantly, rigorous it provides
Most importantly, it provides a rigorous testbed for evaluating and comparing approaches to these problems.
4,811
is publicly agents, the benchmark the All of available. including software,
All of the software, including the benchmark agents, is publicly available.
4,812
Detrended of performed and (DFA) ST, was times on series analysis the fluctuation SS. SL,
Detrended fluctuation analysis (DFA) was performed on the times series of ST, SL, and SS.
4,813
contrary, parameters condition. all anti-persistent under the were On the dual-constraints three
On the contrary, all the three parameters were anti-persistent under dual-constraints condition.
4,814
have soundness been convergence HSVI's and proven.
HSVI's soundness and convergence have been proven.
4,815
ATL-type logical verify systems us allows This express frameworks. and BDI properties of to using
This allows us to express and verify properties of BDI systems using ATL-type logical frameworks.
4,816
graphs conventional are to context, graphs (MFGs). referred as the this factor factor In multiplicative
In this context, the conventional factor graphs are referred to as multiplicative factor graphs (MFGs).
4,817
the the an AR cases In choice impact, results. produced best the had where
In the cases where the choice had an impact, AR produced the best results.
4,818
function. they However work an intractability the are due to of with to complicated likelihood
However they are complicated to work with due to an intractability of the likelihood function.
4,819
tractable natural the consider function. is approximations likelihood It to to therefore
It is therefore natural to consider tractable approximations to the likelihood function.
4,820
offer such to approach likelihoods constructing approximation. a principled Composite
Composite likelihoods offer a principled approach to constructing such approximation.
4,821
very complexity. semantics have high by merging operators which computational are defined Most methods
Most merging operators are defined by semantics methods which have very high computational complexity.
4,822
syntactical work define In merging this properties. we its operators rationality exploring some and
In this work we define some syntactical merging operators and exploring its rationality properties.
4,823
The arise simple motor of from the task. learning data performance behavioural a
The data arise from the performance of a simple behavioural motor learning task.
4,824
regions summary allows and contributing interpreted. centrality compact to This to brain visualized be key
This compact summary allows key brain regions contributing to centrality to be visualized and interpreted.
4,825
explore illustrative these correlation We models two for of among cells. questions
We explore these questions for two illustrative models of correlation among cells.
4,826
for expressions disparity of expected Yule We a derive distribution the under trait tree.
We derive expressions for the distribution of expected trait disparity under a Yule tree.
4,827
fixed Our or does tree. not method simulation a require phylogenetic
Our method does not require simulation or a fixed phylogenetic tree.
4,828
of an the required. fusion assessment quality for objective images resolution is spatial So,
So, an objective quality of the spatial resolution assessment for fusion images is required.
4,829
video and of behaviour recognition presents This in paper sequence. review understanding activity a human
This paper presents a review of human activity recognition and behaviour understanding in video sequence.
4,830
diseases horizontally and both of A transmitted. range infectious vertically wide are
A wide range of infectious diseases are both vertically and horizontally transmitted.
4,831
disease explicit affording evolution. This adaptable infectious expression easily into insights is diseases, to specific
This explicit expression is easily adaptable to specific infectious diseases, affording insights into disease evolution.
4,832
A may pertains how theoretical neuroscience resolved. deadlock this open in be to fundamental question
A fundamental open question in theoretical neuroscience pertains to how this deadlock may be resolved.
4,833
algorithms proposed are for estimation. super-resolution spectrum sparsity-based Recently,
Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation.
4,834
dimensions. in screening high A spectrum computation probabilistic developed fast is for also
A probabilistic spectrum screening is also developed for fast computation in high dimensions.
4,835
A Information used Criterion determine regularization to the parameters. high-dimensional of is Bayesian data-resampling version
A data-resampling version of high-dimensional Bayesian Information Criterion is used to determine the regularization parameters.
4,836
connectivity. strengthen the is preserve to links aim network key to The expected
The aim is to strengthen key links to preserve the expected network connectivity.
4,837
and to the result facilitate can approaches be exact used problem. metaheuristic to This
This result can be used to facilitate metaheuristic and exact approaches to the problem.
4,838
future decision possible are often problems simulating by sequences. approximately Sequential action solvable
Sequential decision problems are often approximately solvable by simulating possible future action sequences.
4,839
against NBUE tests and compared. alternatives discussed of These exponentiality are
These tests of exponentiality against NBUE alternatives are discussed and compared.
4,840
simulations. is of empirical size the tests The by obtained
The empirical size of the tests is obtained by simulations.
4,841
different simulations. Carlo popular Monte comparisons Power are using done for alternatives
Power comparisons for different popular alternatives are done using Monte Carlo simulations.
4,842
both comparisons made are sizes. large sample These for and small
These comparisons are made for both small and large sample sizes.
4,843
and of interface. classes a is algorithm The collection a implemented as C++ Python
The algorithm is implemented as a collection of C++ classes and a Python interface.
4,844
exceedingly gene is While precise. highly expression is erratic, embryonic development often usually
While gene expression is often highly erratic, embryonic development is usually exceedingly precise.
4,845
and inter-embryonic development against variations intra- How is robust understood. is not
How development is robust against intra- and inter-embryonic variations is not understood.
4,846
in repression their enhances variations mutual robustness against morphogen Moreover, the embryo-to-embryo dramatically levels.
Moreover, mutual repression dramatically enhances their robustness against embryo-to-embryo variations in the morphogen levels.
4,847
gene include chromosome These changes fission, duplication, rearrangement. and loss, fusion, gain,
These changes include gene gain, loss, duplication, chromosome fusion, fission, and rearrangement.
4,848
in that be suggest Our may hidden error pervasive alignments. breakpoint genome results
Our results suggest that hidden breakpoint error may be pervasive in genome alignments.
4,849
Europe. Judeo-Khazars of their to collapse fled empire, the Eastern Following the
Following the collapse of their empire, the Judeo-Khazars fled to Eastern Europe.
4,850
European of Jewry rise The explained the therefore contribution of by is the Judeo-Khazars.
The rise of European Jewry is therefore explained by the contribution of the Judeo-Khazars.
4,851
retinal non-random of in types retinal termed patterns, positioned neurons Most mosaics. spatially are
Most types of retinal neurons are spatially positioned in non-random patterns, termed retinal mosaics.
4,852
the be mosaics. to in important mechanisms formation developmental of Several thought these are
Several developmental mechanisms are thought to be important in the formation of these mosaics.
4,853
studied methods Transcriptional regulatory have years. for been inference network
Transcriptional regulatory network inference methods have been studied for years.
4,854
to We simulations findings. numerical theoretical our finally validate provide
We finally provide numerical simulations to validate our theoretical findings.
4,855
and objects. in comprise various interactions several a involve with sub-activities sequence performed Human activities
Human activities comprise several sub-activities performed in a sequence and involve interactions with various objects.
4,856
for a This reasoning affordances central task the activity about makes recognition. object
This makes reasoning about the object affordances a central task for activity recognition.
4,857
distributed species Populations and widely encounter specific of to often conditions. environmental adapt
Populations of widely distributed species often encounter and adapt to specific environmental conditions.
4,858
identification bias note that loci. individual differentiated we can the populations Further, strongly adaptive of
Further, we note that strongly differentiated individual populations can bias the identification of adaptive loci.
4,859
biometrics. Fingerprint most publicized is one of well-known and the reconstruction
Fingerprint reconstruction is one of the most well-known and publicized biometrics.
4,860
the numerous because inherent acquisition, of popular reconstruction sources the Fingerprint of ease (e.g. is
Fingerprint reconstruction is popular because of the inherent ease of acquisition, the numerous sources (e.g.
4,861
most have identification. means the positive always practical been Fingerprints of and
Fingerprints have always been the most practical and positive means of identification.
4,862
performance of paper different an gives measurement overview and methods of reconstruction. fingerprint The the
The paper gives an overview of different methods and performance measurement of the fingerprint reconstruction.
4,863
filter paper blocked aims image this to The boundaries. presented deblocking the in algorithm
The image deblocking algorithm presented in this paper aims to filter the blocked boundaries.
4,864
common feature folding a and are bonds protein Hydrogen aggregation. in
Hydrogen bonds are a common feature in protein folding and aggregation.
4,865
a potential, designed bond hydrogen have J. Chem. see We
We have designed a hydrogen bond potential, see J. Chem.
4,866
protein carry describe tertiary we To to interactions. need studies, full out potentials additional
To carry out full protein studies, we need additional potentials to describe tertiary interactions.
4,867
different We have of points discussed view. two
We have discussed two different points of view.
4,868
bond one. hydrogen potential The a is with first structure-based the one combination the of
The first one is the combination of the hydrogen bond potential with a structure-based one.
4,869
peptide we aggregation have it, sequence. Thanks re-studied to including
Thanks to it, we have re-studied peptide aggregation including sequence.
4,870
Besides, folded shapes. we proteins with complete different have simulated
Besides, we have simulated complete proteins with different folded shapes.
4,871
as considerably and are usage the such computational space disk costs, runtime, memory reduced. Thereby,
Thereby, the computational costs, such as runtime, memory usage and disk space are considerably reduced.
4,872
large-scale are systems, Gas design problems and are corresponding and challenging. Transmission complex Networks control
Gas Transmission Networks are large-scale complex systems, and corresponding design and control problems are challenging.
4,873
systems hybrid required networks provides by a models. framework these analysis We that present
We present these networks by a hybrid systems framework that provides required analysis models.
4,874
hybrid computational using we decision-making discuss and optimization discrete methods. Further,
Further, we discuss decision-making using computational discrete and hybrid optimization methods.
4,875
are efficiency of presented the the illustrate method. to Simulations
Simulations are presented to illustrate the efficiency of the method.
4,876
time successful most of system technology. and is the attendance of biometric applications Biometric one
Biometric time and attendance system is one of the most successful applications of biometric technology.
4,877
biometric of the the user store minutiae a in template Most database. systems fingerprint-based
Most fingerprint-based biometric systems store the minutiae template of a user in the database.
4,878
from reconstruction image proposed the The reconstructs algorithm phase minutiae.
The proposed reconstruction algorithm reconstructs the phase image from minutiae.
4,879
product a has used usually as the T-norm. these merits calculating For been
For calculating these merits the product has been usually used as a T-norm.
4,880
this for In different paper T-norms support confidence have calculating measures. the and used been
In this paper different T-norms have been used for calculating the confidence and support measures.
4,881
to would hard find been a Such demimartingales result have whithout techniques. very
Such a result would have been very hard to find whithout demimartingales techniques.
4,882
The time. spreading it disrupts in channel the transmitted signal by
The channel disrupts the transmitted signal by spreading it in time.
4,883
in is slow the it LMS algorithm robust Although, convergence. reliable, is and
Although, the LMS algorithm is robust and reliable, it is slow in convergence.
4,884
of and guaranteed. stability are reaching conditions, the The robustness proposed the with system controller
The reaching conditions, stability and robustness of the system with the proposed controller are guaranteed.
4,885
suited controller addition, proposed and for well implementation. design simple the is In
In addition, the proposed controller is well suited for simple design and implementation.
4,886
of inference A data framework from lacking. populations is for diversity currently such statistical
A statistical framework for inference from diversity data of such populations is currently lacking.
4,887
paper approximations optimal In considered. segmentation means constant by image is of the piecewise the
In the paper the optimal image segmentation by means of piecewise constant approximations is considered.
4,888
analytically The image. experimentally on proved the the and proposed example of solution standard is
The proposed solution is proved analytically and experimentally on the example of the standard image.
4,889
cases energy are Rosetta Remaining all-atom the traced to inaccuracies problem function. in
Remaining problem cases are traced to inaccuracies in the Rosetta all-atom energy function.
4,890
evaluations tracks. in are this of The five divided campaign
The evaluations of this campaign are divided in five tracks.
4,891
or improved OAEI Three to tracks new are of compared been campaigns. have previous these
Three of these tracks are new or have been improved compared to previous OAEI campaigns.
4,892
image. chrominance of Y components are and is component;Cb Cr luminance the
Y is luminance component;Cb and Cr are chrominance components of the image.
4,893
inference Under methods. two this computational we describe model,
Under this model, we describe two computational inference methods.
4,894
for this Multiple have "missing been heritability" proposed. explanations
Multiple explanations for this "missing heritability" have been proposed.
4,895
Detected contribution. interactions this two-locus only of a explain minority
Detected two-locus interactions explain only a minority of this contribution.
4,896
genomic diverse The understanding fundamental Motivation: biology. comparison of genome is datasets to
Motivation: The comparison of diverse genomic datasets is fundamental to understanding genome biology.
4,897
methods at We BITS existing intersections. counting demonstrate that interval outperforms
We demonstrate that BITS outperforms existing methods at counting interval intersections.
4,898
for developed have Many time data. series been methods
Many methods have been developed for time series data.
4,899