Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
illustrate path mechanics few and A chosen well the of following. potential examples
A few well chosen examples illustrate the mechanics and potential of path following.
2,700
propagation constraint. algorithm enforces that this bounds efficient global We on consistency give an
We give an efficient propagation algorithm that enforces bounds consistency on this global constraint.
2,701
on general. constraint is enforcing domain we in Finally, that consistency global prove NP-hard this
Finally, we prove that enforcing domain consistency on this global constraint is NP-hard in general.
2,702
surrounding understanding, the the discussed. to are also brain and environment of the familiarity Image
Image understanding, and the familiarity of the brain to the surrounding environment are also discussed.
2,703
inspirations. We discussion a give also of
We also give a discussion of inspirations.
2,704
imposed at network. Appropriate the outlet and river of nodes conditions are the upstream boundary
Appropriate boundary conditions are imposed at the outlet and upstream nodes of the river network.
2,705
(LSIR). least-squares we propose novel paper, called regression this causal In a independence algorithm inference
In this paper, we propose a novel causal inference algorithm called least-squares independence regression (LSIR).
2,706
analyzed. unclear were The and marked features
The unclear features were marked and analyzed.
2,707
suitable the of and these be seem to techniques approaches images. Sauvola's for Niblack's types
Niblack's and Sauvola's techniques seem to be the suitable approaches for these types of images.
2,708
methods show Most these with character two for and recognition. of readability binarized images improvement
Most of binarized images with these two methods show improvement for readability and character recognition.
2,709
sharp to utilize the obtain localization rate. techniques learning We
We utilize localization techniques to obtain the sharp learning rate.
2,710
bound of kernels. rate the of The the characterized the associated by eigenvalues decay is
The bound is characterized by the decay rate of the eigenvalues of the associated kernels.
2,711
gives decay rate faster a rate. convergence larger A
A larger decay rate gives a faster convergence rate.
2,712
overall results of regularization elastic-net MKL. the our use in suggest theoretical Thus,
Thus, our theoretical results overall suggest the use of elastic-net regularization in MKL.
2,713
useful segmentation. can For it particularly be and example, detection in edge
For example, it can be particularly useful in edge detection and segmentation.
2,714
a divergence to use history. calibrate estimation The of long fossil evidence time has
The use of fossil evidence to calibrate divergence time estimation has a long history.
2,715
analytical We a on results this number trees. with illustrate of small
We illustrate this with a number of analytical results on small trees.
2,716
solution practical elusive. Unfortunately, for remains calibrations multiple a
Unfortunately, a practical solution for multiple calibrations remains elusive.
2,717
continuous Leslie-Gower We model. global properties time food chain of asymptotic study a
We study global asymptotic properties of a continuous time Leslie-Gower food chain model.
2,718
the the this We package YADAS. in algorithm discuss software of implementation
We discuss the implementation of this algorithm in the software package YADAS.
2,719
the structure. "manifold" of the the to word topology properties Here, refers
Here, the word "manifold" refers to the topology properties of the structure.
2,720
pursuit projection a built approximating is algorithm. by manifold The
The approximating manifold is built by a projection pursuit algorithm.
2,721
of of step dimension algorithm, incremented. the the the each manifold is At
At each step of the algorithm, the dimension of the manifold is incremented.
2,722
in Moreover, of the established converges is algorithm a also number it finite that steps.
Moreover, it is also established that the algorithm converges in a finite number of steps.
2,723
that, optimization numerous no We cases, is procedure required. show in
We show that, in numerous cases, no optimization procedure is required.
2,724
are simulated on presented. illustrations real Some data and
Some illustrations on simulated and real data are presented.
2,725
Network We Ecological Analysis these applied resource models. homogenization for calculate to
We applied Ecological Network Analysis to calculate resource homogenization for these models.
2,726
results our evaluated robustness We in two the ways. further of
We further evaluated the robustness of our results in two ways.
2,727
problems many Phase complex been the combinational have studied past transitions in widely decade. in
Phase transitions in many complex combinational problems have been widely studied in the past decade.
2,728
non-verbal interpersonal cues, in Facial relations. important role expressions which convey play an
Facial expressions convey non-verbal cues, which play an important role in interpersonal relations.
2,729
science. may behavioural also It used be in
It may also be used in behavioural science.
2,730
the measure endowed without classifiers. distance This face using the method recognition conventional
This method endowed the face recognition without using the conventional distance measure classifiers.
2,731
best building from are results The category. achieved
The best results achieved are from building category.
2,732
computation results show performance experimental The detection in that both efficiency. "DURF+ERT+SVM" outperforms "SIFT+ERT+SVM" and
The experimental results show that "DURF+ERT+SVM" outperforms "SIFT+ERT+SVM" both in detection performance and computation efficiency.
2,733
results Besides, performance. DURF SIFT in better even detection and combining
Besides, combining DURF and SIFT results in even better detection performance.
2,734
on RANSAC simple tried Real-time SIFT objects, and object is e.g. detection also using
Real-time object detection using SIFT and RANSAC is also tried on simple objects, e.g.
2,735
good achieved. and result drink is can,
drink can, and good result is achieved.
2,736
tools in decreasing effort fields varied search Heuristics of in AI. are crucial
Heuristics are crucial tools in decreasing search effort in varied fields of AI.
2,737
get is to proposed A image features' geometric information. new method
A new method is proposed to get image features' geometric information.
2,738
can quantitatively of A given is performance that be definition of terms measured. in intelligence
A definition of intelligence is given in terms of performance that can be quantitatively measured.
2,739
of achieve intelligent features. exhibit To kinds have that introduced we several goal, this agents
To achieve this goal, we have introduced several kinds of agents that exhibit intelligent features.
2,740
Report agent, are agent, These and agent the Watcher agent. internal External Management Agent,
These are the Management agent, internal agent, External Agent, Watcher agent and Report agent.
2,741
Metrics Vehicle Automatic of for are Checking Agent performance suggested and measurements (VCA). the evaluating
Metrics and measurements are suggested for evaluating the performance of Automatic Vehicle Checking Agent (VCA).
2,742
Calibrate systems. to the facilities intelligent development suggested test and data are facilitate of
Calibrate data and test facilities are suggested to facilitate the development of intelligent systems.
2,743
recognition most the Template of worldwide. methods prevalent is one matching pattern
Template matching is one of the most prevalent pattern recognition methods worldwide.
2,744
most fields. has concept uses detection in visual found It
It has found uses in most visual concept detection fields.
2,745
organization In important of indexing image cases, such and retrieval efficient for becomes images.
In such cases, image indexing becomes important for efficient organization and retrieval of images.
2,746
based system features proposed curvelet extraction. The uses a texture
The proposed system uses a curvelet based texture features extraction.
2,747
describe common several of we models. paper in graphical this such approaches framework In the
In this paper we describe several such approaches in the common framework of graphical models.
2,748
rule a based fuzzy classifier is of Design proposed.
Design of a fuzzy rule based classifier is proposed.
2,749
the poses of computational from important an point This challenge view.
This poses an important challenge from the computational point of view.
2,750
and peripheral boundary texture. includes The limbs, structure protrusions,
The peripheral structure includes limbs, protrusions, and boundary texture.
2,751
our different method, images evaluate is a diffusion-weighted used. of set vendors To from
To evaluate our method, a set of diffusion-weighted images from different vendors is used.
2,752
problem the context in well of a Regularization is neural networks. studied
Regularization is a well studied problem in the context of neural networks.
2,753
knots. paths Polymers closure and open can polygonal as be their generates modeled
Polymers can be modeled as open polygonal paths and their closure generates knots.
2,754
reduction computation. a scheme multi-component polynomial Our approach with couples the
Our approach couples a multi-component reduction scheme with the polynomial computation.
2,755
descriptions scale, viewpoint to changes and rotation, small The are in invariant articulations. resulting
The resulting descriptions are invariant to scale, rotation, small changes in viewpoint and articulations.
2,756
representation skeletons. not from connected common The suffer the problems of traditional instability does the
The representation does not suffer from the common instability problems of the traditional connected skeletons.
2,757
the shapes well. qualities It perceptual captures of
It captures the perceptual qualities of shapes well.
2,758
among the the shapes Therefore becomes finding and easier. differences similarities
Therefore finding the similarities and the differences among shapes becomes easier.
2,759
The the organism. of behind motor complexity the an metabolism is biological
The metabolism is the motor behind the biological complexity of an organism.
2,760
on fundamental based standard captured randomization. These by cannot be null-models factors
These fundamental factors cannot be captured by standard null-models based on randomization.
2,761
metabolism the arrangement of interpret modular as a functionality. variegated trace of evolved We more
We interpret the more variegated modular arrangement of metabolism as a trace of evolved functionality.
2,762
latter This has tunneling. stochastic termed process been
This latter process has been termed stochastic tunneling.
2,763
population has work focused on Moran model Previous genetics. of the
Previous work has focused on the Moran model of population genetics.
2,764
also for results numerical efficiently to how populations. I finite obtain show
I also show how to efficiently obtain numerical results for finite populations.
2,765
We through programming solve translation satisfaction constraint answer to (ASP). problems set
We solve constraint satisfaction problems through translation to answer set programming (ASP).
2,766
computational demonstrate the Experiments approach. value of this
Experiments demonstrate the computational value of this approach.
2,767
energy variational functional. First, the classic we extend chamfer-matching to a
First, we extend the classic chamfer-matching energy to a variational functional.
2,768
can a meshless deformations. we deformation model Secondly, high-curvature significant that introduce handle
Secondly, we introduce a meshless deformation model that can handle significant high-curvature deformations.
2,769
is penalizing between field fields. local regularized global deformation by The inconsistencies
The global deformation field is regularized by penalizing inconsistencies between local fields.
2,770
minimizing registration combined chamfer-energy consistency the functional is with achieved by a regularizer. Finally, variational
Finally, registration is achieved by minimizing a variational chamfer-energy functional combined with the consistency regularizer.
2,771
number on of effectiveness experiments. the a We method demonstrate our of
We demonstrate the effectiveness of our method on a number of experiments.
2,772
paper this auto-encoders. approach novel in present We training a deterministic for
We present in this paper a novel approach for training deterministic auto-encoders.
2,773
Similar the of cycle also lengths. optimize nature noise multimodal the levels
Similar noise levels also optimize the multimodal nature of the cycle lengths.
2,774
is selection acceptable A arguments. issue systems main argumentation of abstract of the for sets
A main issue for abstract argumentation systems is the selection of acceptable sets of arguments.
2,775
(J. as introduced argumentation, Bench-Capon by Value-based
Value-based argumentation, as introduced by Bench-Capon (J.
2,776
computationally accepted, are argument is subjectively an problems. or respectively, objectively whether intractable Deciding
Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems.
2,777
methodology numerical The resulting with specific experiments three models. on illustrated is
The resulting methodology is illustrated with numerical experiments on three specific models.
2,778
property. is broken-triangle First, tractable of a basic class by binary using the QCSPs identified
First, a basic tractable class of binary QCSPs is identified by using the broken-triangle property.
2,779
for class, QCSPs. identify more class Finally, extendable min-of-max the a tractable generalized i.e., we
Finally, we identify a more generalized tractable class, i.e., the min-of-max extendable class for QCSPs.
2,780
models them estimates new estimating accurately more separately. the method the than simulations, In
In simulations, the new method estimates the models more accurately than estimating them separately.
2,781
computational a goal macromolecules of long-sought structure biophysics. prediction Atomic-accuracy of is
Atomic-accuracy structure prediction of macromolecules is a long-sought goal of computational biophysics.
2,782
methods can resulting The are easy various efficient, implement, to accommodate types of and constraints.
The resulting methods are easy to implement, efficient, and can accommodate various types of constraints.
2,783
complete focus on planners current plans. domain and Most models generating assume correct
Most current planners assume complete domain models and focus on generating correct plans.
2,784
error-prone and Unfortunately, a laborious domain modeling is task.
Unfortunately, domain modeling is a laborious and error-prone task.
2,785
We showing Probabilistic-FF, state-of-the-art planner, the results of our with approach. present a promise experimental
We present experimental results with Probabilistic-FF, a state-of-the-art planner, showing the promise of our approach.
2,786
combined By the sustained is of demographic understood. and effect contrast, fluctuations poorly recombination
By contrast, the combined effect of recombination and sustained demographic fluctuations is poorly understood.
2,787
formulas. for task propositional of to propositional A compute is models logic fundamental
A fundamental task for propositional logic is to compute models of propositional formulas.
2,788
for solvers. this Programs are called task developed satisfiability
Programs developed for this task are called satisfiability solvers.
2,789
In paper, this we consider a structured regularization. sparse hierarchical
In this paper, we consider a sparse hierarchical structured regularization.
2,790
digital surgeon This to automatically. acetabular technique recognise implant a enables size the
This technique enables the surgeon to recognise a digital acetabular implant size automatically.
2,791
presents and approach machine This cells families. paper for part novel obtaining and a new
This paper presents a new and novel approach for obtaining machine cells and part families.
2,792
the is cube". easily-understood an Rubik's is Cube which originally "magic puzzle, called
Rubik's Cube is an easily-understood puzzle, which is originally called the "magic cube".
2,793
planning problem, studied has a a is It time. well-known which for long been
It is a well-known planning problem, which has been studied for a long time.
2,794
This solvers studies puzzle. to are modern whether this applicable SAT paper
This paper studies whether modern SAT solvers are applicable to this puzzle.
2,795
Using efficient cannot only encoding puzzle. solve this
Using only efficient encoding cannot solve this puzzle.
2,796
are new demonstrate our efficient. empirical and technique results SAT both solving The translation
The empirical results demonstrate both our SAT translation and new solving technique are efficient.
2,797
Library. with memory requirements These Philips compared (in are original implementations costs) Nexperia and speed,
These original implementations are compared (in speed, memory requirements and costs) with Philips Nexperia Library.
2,798
periodic stimulated train. multiple fire on Neurons timescales when irregularly pulse a with
Neurons fire irregularly on multiple timescales when stimulated with a periodic pulse train.
2,799