Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
 Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
d-separation, theory introduce relational independence deriving conditional a from We models. for facts relational
We introduce relational d-separation, a theory for deriving conditional independence facts from relational models.
6,100
methods. present We with analysis for image registration performance gradient descent a
We present a performance analysis for image registration with gradient descent methods.
6,101
multiclass algorithms We graph-based high-dimensional present of for data. segmentation two
We present two graph-based algorithms for multiclass segmentation of high-dimensional data.
6,102
a the numerical scheme. convex minimizes algorithm functional splitting The first using
The first algorithm minimizes the functional using a convex splitting numerical scheme.
6,103
the The which Chao's theory as lower retrieve estimate estimator, species richness. of we generalizes
The theory generalizes Chao's estimator, which we retrieve as the lower estimate of species richness.
6,104
is in recognition proposed report. this Iris
Iris recognition is proposed in this report.
6,105
(CM) matrices FC. for LLD by were higher cross-correlation characterized Raw
Raw cross-correlation matrices (CM) for LLD were characterized by higher FC.
6,106
measures network Topological between showed groups. no significant differences
Topological network measures showed no significant differences between groups.
6,107
addition, in LLD. caudate right was diffuse connectivity In more nucleus
In addition, right caudate nucleus connectivity was more diffuse in LLD.
6,108
paper studies MSBNs, presented propagation. with originally UpdateBelief, for operation inter-subnet the This
This paper studies the operation UpdateBelief, presented originally with MSBNs, for inter-subnet propagation.
6,109
available statistical allow is to reliable not Often estimation. data probability enough for
Often not enough statistical data is available to allow for reliable probability estimation.
6,110
the amenable encoding be Available may not network. directly for information in
Available information may not be directly amenable for encoding in the network.
6,111
probabilities. numerical reluctant provide Finally, be domain to experts may
Finally, domain experts may be reluctant to provide numerical probabilities.
6,112
over then desired second-order this form probabilities. probability to derive use We distributions the canonical
We then use this canonical form to derive second-order probability distributions over the desired probabilities.
6,113
exact networks. for algorithms present in two inference causal approximate We and
We present two algorithms for exact and approximate inference in causal networks.
6,114
properties proposed also illustrating the some experimental results of present We algorithms. the
We also present some experimental results illustrating the properties of the proposed algorithms.
6,115
been a Consider network. to evidence Bayesian has e entered the situation where some
Consider the situation where some evidence e has been entered to a Bayesian network.
6,116
architecture. propagation HUGIN is into a propagation Cautious Shafer-Shenoy-like a of modification
Cautious propagation is a modification of HUGIN propagation into a Shafer-Shenoy-like architecture.
6,117
of networks to the belief application diagnosis of systems. an in bottlenecks We describe computer
We describe an application of belief networks to the diagnosis of bottlenecks in computer systems.
6,118
characterized are distributions. Uncertainty and with workloads, values Gaussian predictions, counter in
Uncertainty in workloads, predictions, and counter values are characterized with Gaussian distributions.
6,119
presented. in results are Initial bottlenecks diagnosing
Initial results in diagnosing bottlenecks are presented.
6,120
sound but always in conservative Predict that complete. it a exhibits behavior not always is
Predict exhibits a conservative behavior in that it is always sound but not always complete.
6,121
for develops paper order a reasoning. calculus This simple magnitude of
This paper develops a simple calculus for order of magnitude reasoning.
6,122
completeness with A is semantics soundness and results. given
A semantics is given with soundness and completeness results.
6,123
through cut justify ideas analysis. limit our We theoretically
We theoretically justify our ideas through limit cut analysis.
6,124
A in benefits technique these the of key graphical idea achieving modeling. is
A key technique in achieving these benefits is the idea of graphical modeling.
6,125
effective we implications algorithms. What how has we learn for it important and learn
What we learn and how we learn it has important implications for effective algorithms.
6,126
analyzing reasoning. already useful proved in default Plausibility measures have
Plausibility measures have already proved useful in analyzing default reasoning.
6,127
hypothesis and selection. We discuss testing model
We discuss hypothesis testing and model selection.
6,128
almost method this One such is problem directly with that never are available. priors
One problem with this method is that such priors are almost never directly available.
6,129
probabilistic of second is diagnosis facing model-based persistence. A modeling the problem
A second problem facing probabilistic model-based diagnosis is the modeling of persistence.
6,130
problems using from In paper, techniques these we this theory. Reliability address
In this paper, we address these problems using techniques from Reliability theory.
6,131
scheme observations. a also We multiple when model handling time develop persistence tagged to
We also develop a scheme to model persistence when handling multiple time tagged observations.
6,132
general a We for metric, derive scoring Bayesian both appropriate domains.
We derive a general Bayesian scoring metric, appropriate for both domains.
6,133
uncertainty. under we extend diagram decisions for this (ID) In paper the representation influence
In this paper we extend the influence diagram (ID) representation for decisions under uncertainty.
6,134
constraints represent often diagrams by decision influence into nodes. want to Users of arrows
Users of influence diagrams often want to represent constraints by arrows into decision nodes.
6,135
arrows decision relevance constraints nodes. We represent on by into decisions allowing
We represent constraints on decisions by allowing relevance arrows into decision nodes.
6,136
(IRIDs). diagrams the representation call We information/relevance resulting influence
We call the resulting representation information/relevance influence diagrams (IRIDs).
6,137
allow influence for decisions. direct diagrams representation of specification and Information/relevance constrained
Information/relevance influence diagrams allow for direct representation and specification of constrained decisions.
6,138
We combination solve use IRIDs. to dynamic programming stochastic a and Gibbs of sampling
We use a combination of stochastic dynamic programming and Gibbs sampling to solve IRIDs.
6,139
exact useful This is solving method for fail. IDs when methods especially
This method is especially useful when exact methods for solving IDs fail.
6,140
transformations. We on present based equivalent Bayesian simple network structures local of a characterization
We present a simple characterization of equivalent Bayesian network structures based on local transformations.
6,141
is the characterization The significance of twofold.
The significance of the characterization is twofold.
6,142
the of potential costs, uncertain We consider costs. among with probabilistic dependencies problem edge the
We consider the problem of uncertain edge costs, with potential probabilistic dependencies among the costs.
6,143
apply debt the of problem fraud/uncollectible detection telecommunication to Bayesian services. models network We for
We apply Bayesian network models to the problem of fraud/uncollectible debt detection for telecommunication services.
6,144
C queries been true?") "If would true, have of counterfactual were A (e.g., Evaluation
Evaluation of counterfactual queries (e.g., "If A were true, would C have been true?")
6,145
planning, of and is diagnosis, determination important liability, analysis. to policy fault
is important to fault diagnosis, planning, determination of liability, and policy analysis.
6,146
new taxa require taxa await description. revision and Older
Older taxa require revision and new taxa await description.
6,147
mechanically their The evolution long sauropods obscure. are and necks characteristic of perplexing is
The characteristic long necks of sauropods are mechanically perplexing and their evolution is obscure.
6,148
holotype characters. reveals Xenoposeidon six of preservation unique The the excellent
The excellent preservation of the Xenoposeidon holotype reveals six unique characters.
6,149
is unique particularly ilium unusual, The five exhibiting features.
The ilium is particularly unusual, exhibiting five unique features.
6,150
networks. representing probability define Bayesian classes for discrete-time We a context-sensitive logic of temporal temporal
We define a context-sensitive temporal probability logic for representing classes of discrete-time temporal Bayesian networks.
6,151
We for provide a language. declarative semantics our
We provide a declarative semantics for our language.
6,152
approach. programming We use related concepts logic our in to justify
We use related concepts in logic programming to justify our approach.
6,153
value method based on is theory. The extreme
The method is based on extreme value theory.
6,154
for in Implications conclusion. are discussed the learning
Implications for learning are discussed in the conclusion.
6,155
represent networks Bayesian causal relationships. Bayesian networks acausal independence, probabilistic causal Whereas represent
Whereas acausal Bayesian networks represent probabilistic independence, causal Bayesian networks represent causal relationships.
6,156
this we examine paper, learning In types both for Bayesian networks. methods of
In this paper, we examine Bayesian methods for learning both types of networks.
6,157
networks fairly developed. methods well Bayesian acausal learning are for
Bayesian methods for learning acausal networks are fairly well developed.
6,158
{em introduce sufficient assumptions, and component called independence}. mechanism {em We independence} two
We introduce two sufficient assumptions, called {em mechanism independence} and {em component independence}.
6,159
filtering. sigma-point novel to In this application methods continuous-discrete paper, a of describe we
In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering.
6,160
continuous- exactly. principle, can filtering In the problem nonlinear discrete solved be
In principle, the nonlinear continuous- discrete filtering problem can be solved exactly.
6,161
contains the terms practice, In intractible. computationally that solution are
In practice, the solution contains terms that are computationally intractible.
6,162
demonstrate problems. cope with better such to is method our equipped that We
We demonstrate that our method is better equipped to cope with such problems.
6,163
obtained simultaneously. identification the Furthermore, be parameters shall
Furthermore, the identification parameters shall be obtained simultaneously.
6,164
proposed be shall for an classification to The method applied example.
The proposed method shall be applied for classification to an example.
6,165
of plants. be Iris {em three for Database} learnt all The shall Plant kinds
The {em Iris Plant Database} shall be learnt for all three kinds of plants.
6,166
semantic in environment. research Ontology the technique of current in emerging an field is
Ontology is an emerging technique in the current field of research in semantic environment.
6,167
decision cost. strategy low repair framework, has good expected theoretic a In a
In a decision theoretic framework, a good repair strategy has low expected cost.
6,168
are components failures system (b) independent. The of the
(b) The failures of the system components are independent.
6,169
of functions properties acceptance General estabilished. are
General properties of acceptance functions are estabilished.
6,170
planning. decision-theoretic techniques discusses paper efficient This performing for
This paper discusses techniques for performing efficient decision-theoretic planning.
6,171
method. method game efficient more than pruning the the rollback is For trees,
For game trees, the pruning method is more efficient than the rollback method.
6,172
the Also encoding examine graphical paper, in of relationships. this causal we
Also in this paper, we examine the graphical encoding of causal relationships.
6,173
causal Pearl's a establish In canonical addition, we form correspondence theory. between and
In addition, we establish a correspondence between canonical form and Pearl's causal theory.
6,174
kind equation DAG structural model. one models of Recursive are
Recursive structural equation models are one kind of DAG model.
6,175
belief a increasingly reasoning. networks diagnostic used bing are knowledge representation for as Bayesian
Bayesian belief networks are bing increasingly used as a knowledge representation for diagnostic reasoning.
6,176
and only. observations conducting One represent system faults method to simple for reasoning diagnostic is
One simple method for conducting diagnostic reasoning is to represent system faults and observations only.
6,177
general, precomputing is policies optimal intractable. repair In
In general, precomputing optimal repair policies is intractable.
6,178
is precomputation for algorithm of strategy. suitable an hierarchical repair The optimal off-line repair
The hierarchical repair algorithm is suitable for off-line precomputation of an optimal repair strategy.
6,179
are vision. computer important Object problems in and detection recognition
Object detection and recognition are important problems in computer vision.
6,180
generalization properties. provides new which a good propose discriminative and We codebook, also hierarchical
We also propose a new hierarchical codebook, which provides good generalization and discriminative properties.
6,181
learning. It the of capability dynamic has
It has the capability of dynamic learning.
6,182
of been geometric work The has detecting images real shapes in completed. preliminary
The preliminary work of detecting geometric shapes in real images has been completed.
6,183
of is the this work This focus report. preliminary
This preliminary work is the focus of this report.
6,184
for detection/recognition also in is realizing object path brief. Future discussed method proposed the
Future path for realizing the proposed object detection/recognition method is also discussed in brief.
6,185
complete missing solutions provides for the model. analytic component to the author's the and
and provides the missing component for the complete analytic solutions to the author's model.
6,186
possible when experimentation (i.e. compared plans needed uncertainties are is resolving for Efficient
Efficient experimentation is needed for resolving uncertainties when possible plans are compared (i.e.
6,187
sufficient a locally selecting with should optimal statistical significance experimentation for be (i.e. plan The
The experimentation should be sufficient for selecting with statistical significance a locally optimal plan (i.e.
6,188
vastly that An incomplete models presented. is exploits to fault approach isolation
An approach to fault isolation that exploits vastly incomplete models is presented.
6,189
A example illustrates of the realistic approach. benefits this
A realistic example illustrates the benefits of this approach.
6,190
in systems the of so-called issue important problem. use expert An the is brittleness
An important issue in the use of expert systems is the so-called brittleness problem.
6,191
model a world. of part the only limited Expert systems
Expert systems model only a limited part of the world.
6,192
is this model In represented relational as generalized the database. framework, probability a
In this framework, the probability model is represented as a generalized relational database.
6,193
standard relational Subsequent processed can requests be queries. probabilistic as
Subsequent probabilistic requests can be processed as standard relational queries.
6,194
systems be reasoning system. Conventional easily database approximate management for adopted can an implementing such
Conventional database management systems can be easily adopted for implementing such an approximate reasoning system.
6,195
to an algorithm the give transform. We implement
We give an algorithm to implement the transform.
6,196
example, to Default represent prioritization inheritance, adequately. typically requires for specificity non-layered
Default inheritance, for example, typically requires non-layered prioritization to represent specificity adequately.
6,197
logic stratified with negation-as-failure. : with programs
: with stratified logic programs with negation-as-failure.
6,198
known programs previously logic equivalently Such representable circumscriptions. be predicate layered-priority to are as
Such logic programs are previously known to be representable equivalently as layered-priority predicate circumscriptions.
6,199