Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
 Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
algorithms present reliable yet to calibrate and the do proposed We the inference. system simple
We present simple yet reliable algorithms to calibrate the proposed system and do the inference.
12,300
in low-dimensional often to lie different belong corresponding they subspaces High-dimensional to. classes data
High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to.
12,301
an vision. role in plays computer important Texture
Texture plays an important role in computer vision.
12,302
for analysis. novel a texture complexity characterization, approach based paper This on presents
This paper presents a novel approach for texture characterization, based on complexity analysis.
12,303
the images the from method An album Brodatz using experiment illustrates performance.
An experiment using images from the Brodatz album illustrates the method performance.
12,304
classification. focused work the on scenarios binary Most of of those were
Most of those work were focused on the scenarios of binary classification.
12,305
of linear preceding individually researches the presence data, sparse recommended analysis(LDA). multi-class In pairwise discriminant
In the presence of multi-class data, preceding researches recommended individually pairwise sparse linear discriminant analysis(LDA).
12,306
properties It among enjoys features. allows which non-asymptotic appealing insignificant correlations
It enjoys appealing non-asymptotic properties which allows insignificant correlations among features.
12,307
This exhibits superior estimator both data. capability simulated real and on
This estimator exhibits superior capability on both simulated and real data.
12,308
morphology. semitic is a complex Arabic by a characterized language rich and
Arabic is a semitic language characterized by a complex and rich morphology.
12,309
for online Several building handwriting research have systems. efforts recognition Arabic devoted been
Several research efforts have been devoted for building online Arabic handwriting recognition systems.
12,310
Arabic paper, online In this database. we large AltecOnDB, scale handwriting a introduce
In this paper, we introduce AltecOnDB, a large scale online Arabic handwriting database.
12,311
include and complete The digits punctuation marks. that samples sentences are collected
The collected samples are complete sentences that include digits and punctuation marks.
12,312
and tools phases. to verification verification are and facilitate Annotation annotation developed the
Annotation and verification tools are developed to facilitate the annotation and verification phases.
12,313
considerable the promise and to geometry topology. between gap persistence bears bridge Multidimensional
Multidimensional persistence bears considerable promise to bridge the gap between geometry and topology.
12,314
However, practical a has robust construction and been challenge. its
However, its practical and robust construction has been a challenge.
12,315
introduce families multiscale namely two multidimensional We and persistence. persistence of multidimensional pseudo-multidimensional persistence,
We introduce two families of multidimensional persistence, namely pseudo-multidimensional persistence and multiscale multidimensional persistence.
12,316
unfolded between proteins multidimensional folded observed partial transition has persistence. and been Topological in
Topological transition between partial folded and unfolded proteins has been observed in multidimensional persistence.
12,317
signals The smart sensors observing from come a environment.
The signals come from sensors observing a smart environment.
12,318
central a biochemistry. Allosteric of proteins structural in and problem communication yet unsolved is
Allosteric communication in proteins is a central and yet unsolved problem of structural biochemistry.
12,319
based on a proposes fractal descriptor work This theory. texture
This work proposes a texture descriptor based on fractal theory.
12,320
descriptors. The the based on is method Bouligand-Minkowski
The method is based on the Bouligand-Minkowski descriptors.
12,321
average from and features extract entropy Thus, we both deviation.
Thus, we extract entropy features from both average and deviation.
12,322
the of concatenation measures. by proposed provided are descriptors such The
The proposed descriptors are provided by the concatenation of such measures.
12,323
process. renewal point neuron A fed with is a
A neuron is fed with a point renewal process.
12,324
another three given. provided to the calculate This any pdfs are of the allows two
This allows to calculate any of the three pdfs provided the another two are given.
12,325
corresponding is derived. between Similar relation variances and means
Similar relation between corresponding means and variances is derived.
12,326
model. for relations binding neuron are exactly The checked the
The relations are checked exactly for the binding neuron model.
12,327
propose we novel texture for obtaining a gray-level images. work, technique this of In descriptors
In this work, we propose a novel technique for obtaining descriptors of gray-level texture images.
12,328
be detection as approach object the that used general purpose can toolbox. We a believe
We believe that the approach can be used as a general purpose object detection toolbox.
12,329
car achieved and We dataset, on algorithm UIUC tested the an result. outstanding
We tested the algorithm on UIUC car dataset, and achieved an outstanding result.
12,330
is such concerned shape situations. The the this challenging problem extraction work in in
The problem concerned in this work is the shape extraction in such challenging situations.
12,331
shape alignment We approach and through extraction recovery. the shape
We approach the shape extraction through shape alignment and recovery.
12,332
contour Our shape energies. active idea deformation in to model of minimizing use general is
Our idea is to use general model of shape deformation in minimizing active contour energies.
12,333
evolution evolution variation the (PVSE). The shape curve called is prior
The curve evolution is called the prior variation shape evolution (PVSE).
12,334
derive for active minimizing energy-minimizing energies. also the contour We PVSE
We also derive the energy-minimizing PVSE for minimizing active contour energies.
12,335
choosing PVSE, theory For shape a of preservability of PVSE established. shape-preserving such the is
For choosing such shape-preserving PVSE, a theory of shape preservability of the PVSE is established.
12,336
the the contain five at were presented papers and notes which accepted workshop. These
These notes contain the five papers which were accepted and presented at the workshop.
12,337
can hypothesis confidence be conduct it construct tests. intervals to Hence and used valid
Hence it can be used to construct valid confidence intervals and conduct hypothesis tests.
12,338
with desired convergence rate and it first-stage any allows estimator sparsity. for Instead, empirical
Instead, it allows for any first-stage estimator with desired convergence rate and empirical sparsity.
12,339
results the verify theory. Finally, empirical provide we to
Finally, we provide empirical results to verify the theory.
12,340
Synchronized cortical to were in ex-vivo scale large responses stimuli network studied networks.
Synchronized network responses to stimuli were studied in ex-vivo large scale cortical networks.
12,341
as of responsiveness in, Network the or residency plane. is amongst, shifting areas latency-decay reflected
Network responsiveness is reflected as residency in, or shifting amongst, areas of the latency-decay plane.
12,342
for dimensional dimensional models. the high assessment We uncertainty consider of in problem components low
We consider the problem of uncertainty assessment for low dimensional components in high dimensional models.
12,343
both consider and for M-estimators. We confidence hypothesis generic penalized tests regions
We consider both hypothesis tests and confidence regions for generic penalized M-estimators.
12,344
broaden framework this applications. generalize its also to We
We also generalize this framework to broaden its applications.
12,345
model theory for we establish Second, misspecification. the
Second, we establish the theory for model misspecification.
12,346
back theoretical numerical the are Thorough developed up conducted to studies results.
Thorough numerical studies are conducted to back up the developed theoretical results.
12,347
a to back numerical our example are real up data Thorough provided results. simulations and
Thorough numerical simulations and a real data example are provided to back up our results.
12,348
spurred of improving the research This has the accuracy shortcoming into localization.
This shortcoming has spurred the research into improving the accuracy of localization.
12,349
out Until now, been and investigations carried of independently. scientific however, memory have humanistic
Until now, however, humanistic and scientific investigations of memory have been carried out independently.
12,350
process. and overview a provide stimulating perspectives these diverse memory Together the broad of
Together these diverse perspectives provide a broad and stimulating overview of the memory process.
12,351
regime. matrix have guarantees Recently sampling for the non-uniform completion been obtained in theoretical
Recently theoretical guarantees have been obtained for matrix completion in the non-uniform sampling regime.
12,352
To deviation and of large employ measure a a bound concentration this bound. accomplish we
To accomplish this we employ a concentration of measure bound and a large deviation bound.
12,353
E. D. In Sontag, Biophys. [J. and Barton P.
In [J. P. Barton and E. D. Sontag, Biophys.
12,354
used order recognition improve in been rate. to techniques Various decision have the fusion
Various decision fusion techniques have been used in order to improve the recognition rate.
12,355
Bosphorus databases. proposed FERET, has on system and The been HP, face the tested
The proposed system has been tested on the FERET, HP, and Bosphorus face databases.
12,356
compared The and proposed conventional is system techniques. thestate-of-the-art with
The proposed system is compared with conventional and thestate-of-the-art techniques.
12,357
results. Our by is thorough theory numerical supported
Our theory is supported by thorough numerical results.
12,358
for solution We numerical problem. procedures discuss of the our efficient
We discuss efficient numerical procedures for the solution of our problem.
12,359
been missing. but general framework a literature, still have Many in constraints is the proposed
Many constraints have been proposed in the literature, but a general framework is still missing.
12,360
We investigate this constraint programming use as framework for task. general of the
We investigate the use of constraint programming as general framework for this task.
12,361
applicable sequence are four that categories mining. constraints We first of identify to
We first identify four categories of constraints that are applicable to sequence mining.
12,362
propose programming two then We formulations. constraint
We then propose two constraint programming formulations.
12,363
called new first global constraint exists-embedding. The introduces a formulation
The first formulation introduces a new global constraint called exists-embedding.
12,364
formulation constraint. one support of type efficient the is most not This but does
This formulation is the most efficient but does not support one type of constraint.
12,365
database specialised formulations can technique in use used algorithms. projected Both the
Both formulations can use the projected database technique used in specialised algorithms.
12,366
flexibility the existing and to compare approach Experiments methods. towards constraint-based settings demonstrate the
Experiments demonstrate the flexibility towards constraint-based settings and compare the approach to existing methods.
12,367
the Gene co-located on chromosome. genes Motivation: blocks are
Motivation: Gene blocks are genes co-located on the chromosome.
12,368
of is common Consecutive behavioral actions repetition sequences. in
Consecutive repetition of actions is common in behavioral sequences.
12,369
to feedback sequences how in auditory Here songbirds. contributes we study repetitive syllable generating
Here we study how auditory feedback contributes to generating repetitive syllable sequences in songbirds.
12,370
distributions repeat models mechanism song. in that this Computational finch explains show Bengalese observed
Computational models show that this mechanism explains repeat distributions observed in Bengalese finch song.
12,371
connectomes, Brain widely or today. being graphs, are explored
Brain graphs, or connectomes, are being widely explored today.
12,372
flow trajectories that instantaneous For we movements. vectors down indicate into first the phase, break
For the first phase, we break down trajectories into flow vectors that indicate instantaneous movements.
12,373
terms reachability set and of in Next, similarity. components' we create motion proximity spatial motion
Next, we create motion components' reachability set in terms of spatial proximity and motion similarity.
12,374
bilateral reducing the filter. begins specular and reflection a The small using method noise with
The method begins with reducing the specular reflection and small noise using a bilateral filter.
12,375
highest technique accuracy. shows achieves The experiment that our result
The experiment result shows that our technique achieves highest accuracy.
12,376
a estimating correspondences across We method propose scenes. for accurate matching fast, dense pixel
We propose a fast, accurate matching method for estimating dense pixel correspondences across scenes.
12,377
match- are into seamlessly The embedded features multi-layer learned a framework. ing then
The learned features are then seamlessly embedded into a multi-layer match- ing framework.
12,378
in fast presented algorithm A feature selection paper. is forward this
A fast forward feature selection algorithm is presented in this paper.
12,379
classifier. Gaussian a It based mixture model on is (GMM)
It is based on a Gaussian mixture model (GMM) classifier.
12,380
GMM used images. hyperspectral for are classifying
GMM are used for classifying hyperspectral images.
12,381
The maximizes estimation spectral classification that an iteratively rate. of features selects algorithm the
The algorithm selects iteratively spectral features that maximizes an estimation of the classification rate.
12,382
is using validation. k-fold The the estimation cross done
The estimation is done using the k-fold cross validation.
12,383
fast proposed. efficient order implementation to time, is terms in In of an perform computing
In order to perform fast in terms of computing time, an efficient implementation is proposed.
12,384
the Furthermore, contains channels. model extracted very few spectral
Furthermore, the extracted model contains very few spectral channels.
12,385
\textit{Group algorithm propose simple To the effective problem, we $K$-Means}. yet a solve
To solve the problem, we propose a simple yet effective algorithm \textit{Group $K$-Means}.
12,386
hierarchical a non-convex we propose for problem. such Besides, a initialization
Besides, we propose a hierarchical initialization for such a non-convex problem.
12,387
effectiveness Experimental the results the of validate approach. well
Experimental results well validate the effectiveness of the approach.
12,388
such the achieved penalizations. the by improvements data-driven illustrate experiments of use Numerical significant
Numerical experiments illustrate the significant improvements achieved by the use of such data-driven penalizations.
12,389
detection most challenges the vision. Object of in computer important is one
Object detection is one of the most important challenges in computer vision.
12,390
are trained Object usually on images. from detectors bounding-boxes still
Object detectors are usually trained on bounding-boxes from still images.
12,391
Recently, an used data. as video source alternative has been of
Recently, video has been used as an alternative source of data.
12,392
behind examine reasons we the performance In gap. this this paper,
In this paper, we examine the reasons behind this performance gap.
12,393
We location for a propose in ImageNet. method annotating objects of the
We propose a method for annotating the location of objects in ImageNet.
12,394
quantum fully that induction argue is to applicable Solomonoff mechanics. also We
We also argue that Solomonoff induction is fully applicable to quantum mechanics.
12,395
distributions constant, When is held confirming produce of neighborhood the similar size patterns isolation-by-distance, predictions.
When neighborhood size is held constant, the distributions produce similar patterns of isolation-by-distance, confirming predictions.
12,396
underlying relationships. Conscious experience awash is with
Conscious experience is awash with underlying relationships.
12,397
probability bias the define Representing can expected shows that quantities. this system distribution a using
Representing this bias using a probability distribution shows that the system can define expected quantities.
12,398
defines the parameters the efe, minimise the Under that requirement brain relationship relationships.
Under the requirement that the relationship parameters minimise efe, the brain defines relationships.
12,399