Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
decomposition on techniques and on aggregation representations. focuses AI-style primarily abstraction, It based
It focuses primarily on abstraction, aggregation and decomposition techniques based on AI-style representations.
2,900
of an alignment for automatic the ontologies. present We PARIS, approach
We present PARIS, an approach for the automatic alignment of ontologies.
2,901
and instances, relations only aligns but PARIS not classes. also
PARIS aligns not only instances, but also relations and classes.
2,902
schema-level. the the Alignments with at instance-level at alignments cross-fertilize
Alignments at the instance-level cross-fertilize with alignments at the schema-level.
2,903
ontology Thereby, system of provides truly our to a problem holistic alignment. the solution
Thereby, our system provides a truly holistic solution to the problem of ontology alignment.
2,904
heart of the is The probabilistic. approach
The heart of the approach is probabilistic.
2,905
This run any PARIS tuning. allows to parameter without
This allows PARIS to run without any parameter tuning.
2,906
the precision of extensive the through efficiency its We algorithm demonstrate and experiments.
We demonstrate the efficiency of the algorithm and its precision through extensive experiments.
2,907
an is subsumption is in It NP-complete language that this proven problem.
It is proven that subsumption in this language is an NP-complete problem.
2,908
more and it to TLU-FU the expressive is reason TL-ALCF. languages how with Then shown
Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF.
2,909
of computations NP-hard. these general are case, both the In
In the general case, both of these computations are NP-hard.
2,910
This a heuristic system paper worlds. STRIPS presents GRT, domain-independent planning for
This paper presents GRT, a domain-independent heuristic planning system for STRIPS worlds.
2,911
local optimal domain proposed. overcoming of states, axioms, is based on a method Finally,
Finally, a method of overcoming local optimal states, based on domain axioms, is proposed.
2,912
Representation formalism. efficiency a space Knowledge the of We Propositional investigate (PKR)
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism.
2,913
a This is of model reasoning and algebra its composed temporal labeled algorithms. temporal
This temporal model is composed of a labeled temporal algebra and its reasoning algorithms.
2,914
label associated of inconsistent manage constraints, mutually Reasoning disjuncts. labeled sets algorithms lists, and
Reasoning algorithms manage labeled constraints, associated label lists, and sets of mutually inconsistent disjuncts.
2,915
These obtain and guarantee network. minimal algorithms a consistency
These algorithms guarantee consistency and obtain a minimal network.
2,916
constraints a be temporal of organized hierarchy Additionally, in can contexts. alternative
Additionally, constraints can be organized in a hierarchy of alternative temporal contexts.
2,917
Therefore, context-dependent on we reason metric constraints intervals on points. and can disjunctive
Therefore, we can reason on context-dependent disjunctive metric constraints on intervals and points.
2,918
paper this make In we the following contributions.
In this paper we make the following contributions.
2,919
of results clearly Our indicate a number conclusions.
Our results clearly indicate a number of conclusions.
2,920
planning is Domain-independent a combinatorial hard problem.
Domain-independent planning is a hard combinatorial problem.
2,921
account quality makes even difficult. more task Taking the plan into
Taking into account plan quality makes the task even more difficult.
2,922
introduces high-quality for efficient a This paradigm new article domain-independent planning. (PbR), by Planning Rewriting
This article introduces Planning by Rewriting (PbR), a new paradigm for efficient high-quality domain-independent planning.
2,923
this have and We applied domains. to existing several planner it implemented
We have implemented this planner and applied it to several existing domains.
2,924
blush, contradictory. first these seem requirements At three
At first blush, these three requirements seem contradictory.
2,925
example, agents' risks making undesirable predictable. thereby behavior less side effects, introducing adaptation For
For example, adaptation risks introducing undesirable side effects, thereby making agents' behavior less predictable.
2,926
the Our is the solution challenge following. all three of to requirements satisfying
Our solution to the challenge of satisfying all three requirements is the following.
2,927
via are (perturbation) evolutionary have online adapted automaton operators. plans, learning finite-state Agents which
Agents have finite-state automaton plans, which are adapted online via evolutionary learning (perturbation) operators.
2,928
ensure first agents' always constraints critical that satisfied, are verified. plans formally are behavioral To
To ensure that critical behavioral constraints are always satisfied, agents' plans are first formally verified.
2,929
reverified adaptation. every after then are They
They are then reverified after every adaptation.
2,930
repaired. the violated, plans are are that constraints concludes If reverification
If reverification concludes that constraints are violated, the plans are repaired.
2,931
the the One these ability of to emotional the of person. understand skills state is
One of these skills is the ability to understand the emotional state of the person.
2,932
network-based describes emotion a approach neural classification. This for thesis
This thesis describes a neural network-based approach for emotion classification.
2,933
better these can select parameters. automatically strategy we that a comparatively combination developed of
we developed a strategy that can automatically select comparatively better combination of these parameters.
2,934
another propagation. back introduce We also perform way to
We also introduce another way to perform back propagation.
2,935
an in We interested authentic were databases. also construction emotion
We were also interested in construction an authentic emotion databases.
2,936
is important very nowadays is no available. task such there This database a because
This is a very important task because nowadays there is no such database available.
2,937
genomic sequential fixations evolution implies new sequences. of Phenotypic
Phenotypic evolution implies sequential fixations of new genomic sequences.
2,938
includes environments. it depends on the explicitly that a term of the Instead sequence
Instead it includes a term that explicitly depends on the sequence of the environments.
2,939
the in quantum systems. classical to and geometric well-studied physical phases related is It
It is related to the well-studied geometric phases in classical and quantum physical systems.
2,940
show ordering that becomes CBJ that We dynamic a such "perfect" redundant. variable exists there
We show that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant.
2,941
selection'. `sample investigates by cost methods for reducing paper annotation This
This paper investigates methods for reducing annotation cost by `sample selection'.
2,942
labeling This new little redundantly examples information. that avoids contribute
This avoids redundantly labeling examples that contribute little new information.
2,943
processing task to natural real-world applied of the language stochastic part-of-speech The was method tagging.
The method was applied to the real-world natural language processing task of stochastic part-of-speech tagging.
2,944
powerful mean-field a The Plefka. by on are theory suggested based approximations
The approximations are based on a powerful mean-field theory suggested by Plefka.
2,945
Plefka's not of is to The theory computationally application tractable. networks belief
The application of Plefka's theory to belief networks is not computationally tractable.
2,946
Taylor based tackle we this new series. approximations To on problem propose
To tackle this problem we propose new approximations based on Taylor series.
2,947
are attractive. the show that scale Small experiments proposed schemes
Small scale experiments show that the proposed schemes are attractive.
2,948
of skill bias Typically such by the supplied hand experts. insights through and is
Typically such bias is supplied by hand through the skill and insights of experts.
2,949
investigated. automatically a paper for model learning this bias is In
In this paper a model for automatically learning bias is investigated.
2,950
reasoning complexity characterize and We algorithms the propositional MBNF. in provide for
We characterize the complexity and provide algorithms for reasoning in propositional MBNF.
2,951
That {\em is self-matching}. there no is,
That is, there is no {\em self-matching}.
2,952
positively in of correlated number tags. the different enhancement The cooperation with is
The enhancement in cooperation is positively correlated with the number of different tags.
2,953
is cooperative the a diverse more population more it becomes. The
The more diverse a population is the more cooperative it becomes.
2,954
is a The technique. estimation robust multi-structure efficient highly outcome
The outcome is a highly efficient multi-structure robust estimation technique.
2,955
solved for ExpTime. that problem can we be in ALCQ, contrast, In show the
In contrast, we show that for ALCQ, the problem can be solved in ExpTime.
2,956
problem nominals, to is PSpace-complete. be known this Without
Without nominals, this problem is known to be PSpace-complete.
2,957
is general. true in example not I show by that this
I show by example that this is not true in general.
2,958
their The and is practical these complexity is orderings relevance of discussed. investigated
The complexity of these orderings is investigated and their practical relevance is discussed.
2,959
goal orderings are different Secondly, compute two reasonable to developed. methods
Secondly, two different methods to compute reasonable goal orderings are developed.
2,960
given on data. are real results Experimental
Experimental results are given on real data.
2,961
it Interestingly, in is decide to if the time exists. polynomial possible lcs
Interestingly, it is possible to decide in polynomial time if the lcs exists.
2,962
planning can for effectively provide universal OBDDs complex domains. scale can and plans
OBDDs can effectively scale and can provide universal plans for complex planning domains.
2,963
are We domains. non-deterministic, arising the in in multi-agent interested particularly addressing complexities
We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains.
2,964
specify We multi-agent domains. language, a non-deterministic, NADL, new introduce description domain planning to
We introduce a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains.
2,965
of language controllable definition agents. the contributes agents The explicit and environment uncontrollable
The language contributes the explicit definition of controllable agents and uncontrollable environment agents.
2,966
planning universal and OBDD-based system UMOP uses NADL algorithms. planning different The
The UMOP planning system uses NADL and different OBDD-based universal planning algorithms.
2,967
includes strong It developed and planning algorithms. the strong previously cyclic
It includes the previously developed strong and strong cyclic planning algorithms.
2,968
is a be system. efficient rich and shown to planning UMOP
UMOP is shown to be a rich and efficient planning system.
2,969
techniques. new of present number Second, refinements existing and novel of we a approximation methods
Second, we present a number of new approximation methods and novel refinements of existing techniques.
2,970
navigation results by on from experiments theoretical the are domain. supported problem The a agent
The theoretical results are supported by experiments on a problem from the agent navigation domain.
2,971
set The by are the an instance. literals backbone of which entailed is
The backbone is the set of literals which are entailed by an instance.
2,972
loci mapping genomic (eQTL) that quantitative trait to transcription. gene Expression aims determine regulate regions
Expression quantitative trait loci (eQTL) mapping aims to determine genomic regions that regulate gene transcription.
2,973
method eQTL new We analysis models, via called linear a fast for eQTL. Matrix present
We present a new method for fast eQTL analysis via linear models, called Matrix eQTL.
2,974
using models. ANOVA can eQTL for and and both regression test linear association Matrix model
Matrix eQTL can model and test for association using both linear regression and ANOVA models.
2,975
correlated with errors. also and heteroscedastic of models supports testing It models
It also supports testing of heteroscedastic models and models with correlated errors.
2,976
a finding Value for well-known POMDPs. for is algorithm optimal iteration policies
Value iteration is a well-known algorithm for finding optimal policies for POMDPs.
2,977
typically to of converge. takes number a large It iterations
It typically takes a large number of iterations to converge.
2,978
This of for proposes method the iteration. paper value convergence accelerating a
This paper proposes a method for accelerating the convergence of value iteration.
2,979
their them Both limitations. of own and have advantages
Both of them have their own advantages and limitations.
2,980
Alignments presents incorporate advantages The Topological and of snakes. the novel algorithm technique to both
The algorithm presents novel technique to incorporate the advantages of both Topological Alignments and snakes.
2,981
this contributions twofold. are paper in Our
Our contributions in this paper are twofold.
2,982
using studied Lasso. effectiveness the of selection work number feature recent A of
A number of recent work studied the effectiveness of feature selection using Lasso.
2,983
are sparse (gLasso) the Lasso structure. consistently under which Group network procedure estimates Conditions derived
Conditions are derived under which the Group Lasso (gLasso) procedure consistently estimates sparse network structure.
2,984
involves condition a The "false score." key connection
The key condition involves a "false connection score."
2,985
been empirical no investigation yet. made However, has
However, no empirical investigation has been made yet.
2,986
are planning evaluate the techniques that We FF describe algorithmic the and system. in used
We describe and evaluate the algorithmic techniques that are used in the FF planning system.
2,987
Unlike facts HSP's our be not assume independent. does heuristic, method to
Unlike HSP's heuristic, our method does not assume facts to be independent.
2,988
for knowledge. Description logics (DLs) structured well-known, Logics managing are suitable,
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge.
2,989
and, concepts supported. becomes reasoning is concepts imprecise about In particular, fuzzy thus,
In particular, concepts becomes fuzzy and, thus, reasoning about imprecise concepts is supported.
2,990
main constraint of reasoning. local of Enforcing consistencies the features one is
Enforcing local consistencies is one of the main features of constraint reasoning.
2,991
relations between and of overview them, We highlight of all some them. make an
We make an overview of all of them, and highlight some relations between them.
2,992
settings. in In this Pruning different present three Reduced analyses of paper we Error
In this paper we present analyses of Reduced Error Pruning in three different settings.
2,993
This different analysis assumptions. is conducted under two
This analysis is conducted under two different assumptions.
2,994
to are analysis that specific examples we the the distributed tree. uniformly a In assume
In a specific analysis we assume that the examples are distributed uniformly to the tree.
2,995
both problem. is empirically this and purpose theoretically of the The paper study to
The purpose of this paper is to study both theoretically and empirically the problem.
2,996
datasets An is classifiers described. of approach imbalanced construction to the from
An approach to the construction of classifiers from imbalanced datasets is described.
2,997
imbalanced are equally not the categories is represented. A dataset classification if approximately
A dataset is imbalanced if the classification categories are not approximately equally represented.
2,998
involves examples. of over-sampling the class Our method synthetic class minority creating minority
Our method of over-sampling the minority class involves creating synthetic minority class examples.
2,999