Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
 Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
applications. been of applied successfully medium-scale in They variety a have
They have been successfully applied in a variety of medium-scale applications.
6,000
for hierarchies. natural These encoding can a attributes be providing objects, framework part-of themselves
These attributes can themselves be objects, providing a natural framework for encoding part-of hierarchies.
6,001
functions on depends is which certain An incremental cost efficient and implementation outlined criteria. satisfying
An efficient and incremental implementation is outlined which depends on cost functions satisfying certain criteria.
6,002
paper algorithm-independent novel, network proposes to This a optimizing inference. approach belief
This paper proposes a novel, algorithm-independent approach to optimizing belief network inference.
6,003
We a a to way. develop models graph unifying technique believe several describing in
We believe to develop a technique describing several graph models in a unifying way.
6,004
implementation a exploits efficient present multithreading. computationally of approach We that this
We present a computationally efficient implementation of this approach that exploits multithreading.
6,005
The elementary Turing-computable. the of are operations procedure
The elementary operations of the procedure are Turing-computable.
6,006
which functions that The procedure used procedures not is are compute to define creative Turing-computable.
The procedure is used to define creative procedures which compute functions that are not Turing-computable.
6,007
fruitful of algorithmic a These results future development. suggest direction
These results suggest a fruitful direction of future algorithmic development.
6,008
Planning actions of decision problems as are modeled processes. effects be Markov where can non-deterministic
Planning problems where effects of actions are non-deterministic can be modeled as Markov decision processes.
6,009
Empirical studies bring about significant that have shown speedups. the techniques can
Empirical studies have shown that the techniques can bring about significant speedups.
6,010
a algorithm Convolutional to MaxPooling segment images. Networks training for We fast present
We present a fast algorithm for training MaxPooling Convolutional Networks to segment images.
6,011
hand, developing the e.g. organisms, other On
On the other hand, developing organisms, e.g.
6,012
a high is, noisy error). these (that Monte Unfortunately, Carlo be can have
Unfortunately, these can be noisy (that is, have a high Monte Carlo error).
6,013
consistency of the method. We our prove
We prove the consistency of our method.
6,014
lineages vertebrate evolving significantly at evidence many are different rates. that suggests Growing
Growing evidence suggests that many vertebrate lineages are evolving at significantly different rates.
6,015
Physiological and water basins to were northern ecological adaptations evaluated.
Physiological and ecological adaptations to northern water basins were evaluated.
6,016
water populations supposed that backwaters the water Saratov's originated sweet was sweet population. from It
It was supposed that the sweet water populations originated from Saratov's backwaters sweet water population.
6,017
function of minimizing problem an the that objective orthonormal matrix. on We depends an consider
We consider the problem of minimizing an objective function that depends on an orthonormal matrix.
6,018
not higher for problems. effective However, Flury dimensional is method the
However, the Flury method is not effective for higher dimensional problems.
6,019
minimization alternating The is algorithm based on on manifolds.
The algorithm is based on alternating minimization on manifolds.
6,020
processing a achieves on unit realtime Implemented performance. it graphics
Implemented on a graphics processing unit it achieves realtime performance.
6,021
the the gene motifs distribution in The of was repeat analyzed.
The distribution of the repeat motifs in the gene was analyzed.
6,022
studies penalized that same in suggest AIC from Simulation when the regression. shortcomings used suffers
Simulation studies suggest that AIC suffers from the same shortcomings when used in penalized regression.
6,023
models. only literature restricted Similar set a but for of the candidate exist in results
Similar results exist in the literature but only for a restricted set of candidate models.
6,024
networks continuous Gaussian representing of continuous that consist composite values. multivariates, Vector take nodes
Vector Gaussian continuous networks consist of composite nodes representing multivariates, that take continuous values.
6,025
domain networks application estimation of monitoring and are these The problems. of
The domain of application of these networks are monitoring and estimation problems.
6,026
this form deriving process illustrate of filter. the decentralized We by the Kalman
We illustrate this process by deriving the decentralized form of the Kalman filter.
6,027
This theory. control artificial from work and concepts modern unifies intelligence
This work unifies concepts from artificial intelligence and modern control theory.
6,028
tightness of numerical by the We experiments. illustrate the bounds
We illustrate the tightness of the bounds by numerical experiments.
6,029
have brute is all possible search we as The method consider force combinations. to
The search is brute force method as we have to consider all possible combinations.
6,030
are chain Markov estimated Carlo of using the Parameters Monte algorithm. a model
Parameters of the model are estimated using a Markov chain Monte Carlo algorithm.
6,031
weighting likelihood These methods variants known of are algorithm. the new
These new methods are variants of the known likelihood weighting algorithm.
6,032
demonstrates empirical algorithms We the evaluation improved an which of their present performance.
We present an empirical evaluation of the algorithms which demonstrates their improved performance.
6,033
is lead may errors model This to the used. when inference
This may lead to inference errors when the model is used.
6,034
are Inference for algorithms for arbitrary belief impractical belief networks networks. complex large,
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks.
6,035
algorithms more to networks shown efficient. been of be Inference for have specialized classes belief
Inference algorithms for specialized classes of belief networks have been shown to be more efficient.
6,036
We trees, their procedure define and binary describe a for join constructing sketch utility, them.
We define binary join trees, describe their utility, and sketch a procedure for constructing them.
6,037
Uncertainty conclusions, their characterize inferences, all their may to or be taken premises three.
Uncertainty may be taken to characterize inferences, their conclusions, their premises or all three.
6,038
characterized never itself by some is uncertainty. of Under inferences the treatments uncertainty,
Under some treatments of uncertainty, the inferences itself is never characterized by uncertainty.
6,039
arbitrary using networks The to standard extends conditioning algorithm Bayesian techniques.
The algorithm extends to arbitrary Bayesian networks using standard conditioning techniques.
6,040
algorithm practicality. empirically demonstrate We evaluate enumeration its the and
We empirically evaluate the enumeration algorithm and demonstrate its practicality.
6,041
states. As (final) of consequences of the utility the a are of specification part
As part of the consequences are a specification of the utility of (final) states.
6,042
programming language. the similar plans, adopts The GOLOG robot to robot
The robot adopts robot plans, similar to the GOLOG programming language.
6,043
problem the the expected is find The plan ?planning' to utility. with highest
The ?planning' problem is to find the plan with the highest expected utility.
6,044
the inputs in discusses possibility paper revision under of This framework belief uncertain theory.
This paper discusses belief revision under uncertain inputs in the framework of possibility theory.
6,045
the distribution. networks qualitatively provide language a representing Bayesian of for properties independence conditional a
Bayesian networks provide a language for qualitatively representing the conditional independence properties of a distribution.
6,046
be can to representation suggest this used support We ways algorithms. effective inference which in
We suggest ways in which this representation can be used to support effective inference algorithms.
6,047
problems domain. analyze diagnosis of coming the structural the from empirically circuit properties We
We analyze empirically the structural properties of problems coming from the circuit diagnosis domain.
6,048
an bounds, have Deterministic probability runtime. usually but exponential algorithms provide
Deterministic algorithms usually provide probability bounds, but have an exponential runtime.
6,049
schemes only estimates. probability provide runtime, Some but polynomial have randomized a
Some randomized schemes have a polynomial runtime, but provide only probability estimates.
6,050
resulting instantiations, bounds. randomized present algorithms We that in partial enumerate probability high-probability
We present randomized algorithms that enumerate high-probability partial instantiations, resulting in probability bounds.
6,051
algorithms sampling Some of these also algorithms. are
Some of these algorithms are also sampling algorithms.
6,052
through package available that A plans is ftp. constructs Quasi-Bayesian anonymous
A package that constructs Quasi-Bayesian plans is available through anonymous ftp.
6,053
to m-ary We extend Bayes this with (hyperplane result observations. networks Naive separability)
We extend this result (hyperplane separability) to Naive Bayes networks with m-ary observations.
6,054
the In effect decision addition, observation-observation of on dependencies we surfaces. illustrate
In addition, we illustrate the effect of observation-observation dependencies on decision surfaces.
6,055
in knowledge results research the and we of discuss implications these Finally, learning. on acquisition
Finally, we discuss the implications of these results on knowledge acquisition and research in learning.
6,056
Axiomatization been used logical implications. for has testing widely
Axiomatization has been widely used for testing logical implications.
6,057
of probability specify hypothesis We the the use concept structure. to
We use the concept of hypothesis to specify the probability structure.
6,058
We information consider case available. probabilistic which the in is not
We consider the case in which probabilistic information is not available.
6,059
of using of the of specification we disjunctions. allow intervals, probability probabilities Instead the for
Instead of using probability intervals, we allow for the specification of the probabilities of disjunctions.
6,060
goal of is default probability An algorithm a calculating the presented. for
An algorithm for calculating the default probability of a goal is presented.
6,061
algorithms flexible diagrams. solving as report on work decision for influence towards problems We represented
We report on work towards flexible algorithms for solving decision problems represented as influence diagrams.
6,062
and constructed incrementally. tree a is represents decision function Each
Each tree represents a decision function and is constructed incrementally.
6,063
paper present fundamental this its and components, definitions model, properties. the of its we In
In this paper we present definitions of the model, its components, and its fundamental properties.
6,064
has that noise asymmetric, we But, show logodds-normal modest effects. even
But, we show that even asymmetric, logodds-normal noise has modest effects.
6,065
by algorithm the difficulty The remedies relaxing pruning (Stochastic Dominance A*) SDA* this condition.
The SDA* (Stochastic Dominance A*) algorithm remedies this difficulty by relaxing the pruning condition.
6,066
employment equipment planning manages sets order that actions. of The constraints feasible agent
The planning agent manages constraints that order sets of feasible equipment employment actions.
6,067
diagram. influence mapped onto abstraction an level an of intermediate is at This
This is mapped at an intermediate level of abstraction onto an influence diagram.
6,068
a this optimum equivalent of simultaneous evaluation of to plans. range is Finding the
Finding this optimum is equivalent to the simultaneous evaluation of a range of plans.
6,069
The area and of study been philosophy active change has in an belief AI.
The study of belief change has been an active area in philosophy and AI.
6,070
inconsistencies One measured approach use in to techniques is knowledge data. to based detect
One approach is to use knowledge based techniques to detect inconsistencies in measured data.
6,071
such the a presents inconsistencies. probabilistic detection for This of article model
This article presents a probabilistic model for the detection of such inconsistencies.
6,072
to by applying it model. a plant is power proposed The approach exemplified
The proposed approach is exemplified by applying it to a power plant model.
6,073
graphs. sparse The algorithm polynomial is on
The algorithm is polynomial on sparse graphs.
6,074
a to network rapid prototyping propose approach We engineering.
We propose a rapid prototyping approach to network engineering.
6,075
complex Methods discussed. network belief for are models evaluating
Methods for evaluating complex belief network models are discussed.
6,076
system. A power supply faulty restoration a typical is in case distribution
A typical case is supply restoration in a faulty power distribution system.
6,077
time, decision incomplete multiple This information over and opportunities stochasticity, inaccurate involves knowledge.
This involves multiple decision opportunities over time, stochasticity, inaccurate information and incomplete knowledge.
6,078
generalizations of is presented. nonmonotonic thresholded A logic
A nonmonotonic logic of thresholded generalizations is presented.
6,079
elimination and way combining present a We conditioning framework. also within this of general
We also present a general way of combining conditioning and elimination within this framework.
6,080
characterized for of Additional are as limitations well. lower probabilities classes other
Additional limitations are characterized for other classes of lower probabilities as well.
6,081
are simply argued of is It a phenomena matter these that interpretation.
It is argued that these phenomena are simply a matter of interpretation.
6,082
The and interpretation introduced is discussed. ontological
The ontological interpretation is introduced and discussed.
6,083
transitions. temporally to probability -dependent assign functions state We
We assign temporally -dependent probability functions to state transitions.
6,084
flight model simulation that CIRCA performance. tests We present demonstrate probabilistic our improve may how
We present flight simulation tests that demonstrate how our probabilistic model may improve CIRCA performance.
6,085
framework a for actions. abstraction provides This formal practical of and sound probabilistic paper
This paper provides a formal and practical framework for sound abstraction of probabilistic actions.
6,086
types this sound Within procedures of action we for framework, three abstraction present abstraction.
Within this framework, we present sound abstraction procedures for three types of action abstraction.
6,087
approximate on related abstraction. end paper work discussions and with the sound and We
We end the paper with discussions and related work on sound and approximate abstraction.
6,088
knowledge shell expert SPIRIT bases. system for an is probabilistic
SPIRIT is an expert system shell for probabilistic knowledge bases.
6,089
show the system. sized the of power applications Medium
Medium sized applications show the power of the system.
6,090
extend develop We troubleshooting methods nonfunctioning a and existing device. for decision-theoretic
We develop and extend existing decision-theoretic methods for troubleshooting a nonfunctioning device.
6,091
this include actions. we to paradigm In this extend paper, taking
In this paper, we extend this paradigm to include taking actions.
6,092
have this largest were lived on terrestrial Sauropoda to planet. animals The the ever
The Sauropoda were the largest terrestrial animals ever to have lived on this planet.
6,093
musculature the of investigated. has yet to the neck However, of the be effect
However, the effect of the musculature of the neck has yet to be investigated.
6,094
experiment carried psychophysical out paradigm. We using masking
We carried out psychophysical experiment using masking paradigm.
6,095
formalize function a of k-d darts. We the using notion sampling
We formalize the notion of sampling a function using k-d darts.
6,096
mutually k-d called A orthogonal, k-dimensional subspaces k-d of set independent, is flats. a dart
A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats.
6,097
dart d Each for k with choose aligned axes flats, has the coordinate efficiency.
Each dart has d choose k flats, aligned with the coordinate axes for efficiency.
6,098
for higher the of a accuracy also estimation volume demonstrate darts problem. dimensional We
We also demonstrate the accuracy of higher dimensional darts for a volume estimation problem.
6,099