Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
 Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
A phosphodiesterase acetyltransferase effective. simulated similarly pair was and activator an a that inhibitor
A pair that simulated a phosphodiesterase inhibitor and an acetyltransferase activator was similarly effective.
11,100
pairs strong present. For additive was synergism both
For both pairs strong additive synergism was present.
11,101
expression that the the the intense layer. in more granular Thresholding signal shows is profiles
Thresholding the expression profiles shows that the signal is more intense in the granular layer.
11,102
between insightful symmetries and establish chains. rapid of orbital model mixing connection Markov an We
We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains.
11,103
models. the MCMC we first probabilistic present for lifted graphical algorithm Thus,
Thus, we present the first lifted MCMC algorithm for probabilistic graphical models.
11,104
the empirical approach. Both of effectiveness the demonstrate and analytical results efficiency and
Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.
11,105
We for bandit tree propose search. alternative algorithms
We propose alternative bandit algorithms for tree search.
11,106
aspect is sensory but of active sensing. understood poorly the important An role processing of
An important but poorly understood aspect of sensory processing is the role of active sensing.
11,107
in developmental deep place progressive takes under architectures Learning scheme. a
Learning takes place in deep architectures under a progressive developmental scheme.
11,108
in the (FIR) domain. filters are designed Finite-impulse-response implemented and frequency
Finite-impulse-response (FIR) filters are designed and implemented in the frequency domain.
11,109
computer gesture extensive recognition, recognition applications games. language virtual and sign Hand possesses reality, in
Hand gesture recognition possesses extensive applications in virtual reality, sign language recognition, and computer games.
11,110
In presented. real-time novel is this hand system paper a for and gesture recognition approach
In this paper a novel and real-time approach for hand gesture recognition system is presented.
11,111
to applied the stage Cross-correlation extraction the is coefficient feature gesture recognize on it. In
In feature extraction stage the Cross-correlation coefficient is applied on the gesture to recognize it.
11,112
susceptible handles. is the to However, close in artifacts, this deformation to method particular
However, this method is susceptible to artifacts, in particular close to the deformation handles.
11,113
linear do and we extend To so, generic regularization introduced on a approach. build recently
To do so, we build on and extend a recently introduced generic linear regularization approach.
11,114
minimizes runtime. complexity only a implementation This and small has the impact on
This minimizes the implementation complexity and has only a small impact on runtime.
11,115
of due images to mixed pixels resolution hyperspectral Hyperspectral contain spatial sensors. low
Hyperspectral images contain mixed pixels due to low spatial resolution of hyperspectral sensors.
11,116
this for multilayer of the (MLNMF) unmixing. In purpose using letter NMF hyperspectral proposed we
In this letter we proposed using multilayer NMF (MLNMF) for the purpose of hyperspectral unmixing.
11,117
signature matrices. sparse a as of product be this In modeled can approach, spectral matrix
In this approach, spectral signature matrix can be modeled as a product of sparse matrices.
11,118
of number In iteratively the fact decomposes a observation in matrix MLNMF layers.
In fact MLNMF decomposes the observation matrix iteratively in a number of layers.
11,119
is real and The on applied algorithm datasets. proposed synthetic
The proposed algorithm is applied on synthetic and real datasets.
11,120
Synthetic endmembers generated spectral data USGS based library. on is from
Synthetic data is generated based on endmembers from USGS spectral library.
11,121
proposed dataset AVIRIS for of as dataset real used method. evaluation a Cuprite been has
AVIRIS Cuprite dataset has been used as a real dataset for evaluation of proposed method.
11,122
measures. SAD based and Results are AAD quantified of on experiments
Results of experiments are quantified based on SAD and AAD measures.
11,123
are and available data research videos purposes. publicly All for source the
All source videos and the data are publicly available for research purposes.
11,124
migration. Results: migration seasonally improves rates the of varying Incorporating modeling
Results: Incorporating seasonally varying migration rates improves the modeling of migration.
11,125
Consequently, not approaches deconvolution cameras current for blind are applicable. traditional
Consequently, current blind deconvolution approaches for traditional cameras are not applicable.
11,126
entropy-driven, would facilitating peptides, this homoaggregation so identical their Predominantly co-localize presentation. collective
Predominantly entropy-driven, this homoaggregation would co-localize identical peptides, so facilitating their collective presentation.
11,127
are fine-tuned time over avoid Concentrations self-proteins to of this. evolutionary
Concentrations of self-proteins are fine-tuned over evolutionary time to avoid this.
11,128
of in described. enhancement targets technique clutter the point is for A
A technique for the enhancement of point targets in clutter is described.
11,129
inverse in are processing. commonplace image biomedical problems Ill-posed
Ill-posed inverse problems are commonplace in biomedical image processing.
11,130
about typically prior imposing Their truth. the knowledge solution ground latent requires
Their solution typically requires imposing prior knowledge about the latent ground truth.
11,131
empirical in an or hoc} ad fashion. chosen are hence {\em Priors mostly
Priors are hence mostly chosen in an {\em ad hoc} or empirical fashion.
11,132
interpretations prior. possible by We and conclude discussing the limitations of the
We conclude by discussing the limitations and possible interpretations of the prior.
11,133
present with characteristics. a architecture We two main cerebellar
We present a cerebellar architecture with two main characteristics.
11,134
sensory errors. in that respond The first increases to one is spikes complex
The first one is that complex spikes respond to increases in sensory errors.
11,135
been trees learning. used Decision widely have in machine
Decision trees have been widely used in machine learning.
11,136
tree fuzzy should to able The handle decision such be data.
The decision tree should be able to handle such fuzzy data.
11,137
method construct a presents fuzzy paper tree. This to decision
This paper presents a method to construct fuzzy decision tree.
11,138
likely in significant on Progress challenging question to is this be near the future.
Progress on this challenging question is likely to be significant in the near future.
11,139
analogous way. In efforts under case of the are well height
In the case of height analogous efforts are well under way.
11,140
iid. are These where not two training are data scenarios typical
These are two typical scenarios where training data are not iid.
11,141
with points an experiment a permissible Consider finite set design of conditions. trial representing
Consider an experiment with a finite set of design points representing permissible trial conditions.
11,142
also forgetting. and use functions the to remembering explain We
We also use the functions to explain remembering and forgetting.
11,143
our algorithm with on compare benchmark evaluate five and We ten datasets. algorithms state-of-the-art
We evaluate and compare our algorithm with ten state-of-the-art algorithms on five benchmark datasets.
11,144
results on algorithm algorithms. better Experimental accuracy average, that, than show gives ten our these
Experimental results show that, on average, our algorithm gives better accuracy than these ten algorithms.
11,145
Our consists technique detection algorithm. and descriptor of keypoint a novel
Our technique consists of a novel descriptor and keypoint detection algorithm.
11,146
approach teaching to e.g. A a concept, visual natural
A natural approach to teaching a visual concept, e.g.
11,147
is to images. bird species, a relevant show
a bird species, is to show relevant images.
11,148
not concept However, a relevant well. equally images all represent
However, not all relevant images represent a concept equally well.
11,149
not words, they other are In necessarily iconic.
In other words, they are not necessarily iconic.
11,150
exactly makes an image iconic? And what
And what exactly makes an image iconic?
11,151
We images. combine predict to them iconicity of new unseen
We combine them to predict iconicity of new unseen images.
11,152
a that iconicity discriminatively predictor ratings. also trained iconicity with direct is We propose
We also propose a direct iconicity predictor that is discriminatively trained with iconicity ratings.
11,153
both systems, get performance. approaches prediction By that combining an human we iconicity
By combining both systems, we get an iconicity prediction that approaches human performance.
11,154
our reduction. variance variates are well-defined that prove control and provide a We positive
We prove that our control variates are well-defined and provide a positive variance reduction.
11,155
reduction. these optimise variance for variates control we how Furthermore to show
Furthermore we show how to optimise these control variates for variance reduction.
11,156
Kalman its in situations this have and paper. to extensions non-linear/non-Gaussian filter used been
Kalman filter and its extensions to non-linear/non-Gaussian situations have been used in this paper.
11,157
method and compared both has to off-line on-line existing methods. been Performance
Performance has been compared to both existing on-line method and off-line methods.
11,158
been methods. not has possible previously extraction these features with The existing of
The extraction of these features has previously not been possible with existing methods.
11,159
and filament The existing of outperforms runtime methods in accuracy. extraction computational terms clearly FS
The FS clearly outperforms existing methods in terms of computational runtime and filament extraction accuracy.
11,160
benchmark and FS implementation database The available the source. open are as the of
The implementation of the FS and the benchmark database are available as open source.
11,161
appearances. and include Some human variation in environments, illumination variation in challenges changes, common
Some common challenges include illumination changes, variation in environments, and variation in human appearances.
11,162
need robust method human Thus a pose estimation. for there for a is
Thus there is a need for a robust method for human pose estimation.
11,163
operations performed subtraction. are from on then background blobs foreground Morphological
Morphological operations are then performed on foreground blobs from background subtraction.
11,164
the However the conditions. relies of on performance initial ICP heavily
However the performance of ICP relies heavily on the initial conditions.
11,165
by occluded the Principal done regions Analysis restoration After is detected, are Component (PCA).
After the occluded regions are detected, restoration is done by Principal Component Analysis (PCA).
11,166
form face Features reconstructed face from the images in normals. non-occluded are extracted the of
Features are extracted from the reconstructed non-occluded face images in the form of face normals.
11,167
conclusions key Our also. are these hold found in to examples
Our key conclusions are found to hold in these examples also.
11,168
theoretical illustrated examples; approach compared by with The general are findings numerical is calculations.
The general approach is illustrated by examples; theoretical findings are compared with numerical calculations.
11,169
Mammographic Experiments Society on (MIAS) dataset. Analysis Image held
Experiments held on Mammographic Image Analysis Society (MIAS) dataset.
11,170
is in science. The Hastings computational tool key a algorithm
The Hastings algorithm is a key tool in computational science.
11,171
it conceptually be detailed While balance, by mathematically grasp. difficult to justified can
While mathematically justified by detailed balance, it can be conceptually difficult to grasp.
11,172
present intuitive and understand complementary the ways algorithm. we derive Here, and to two
Here, we present two complementary and intuitive ways to derive and understand the algorithm.
11,173
capability confer a We a possibly network. stochastic note fluctuations dynamical can to new that
We note that stochastic fluctuations can possibly confer a new dynamical capability to a network.
11,174
structures set theory Algebraic very developed. rapidly are using soft
Algebraic structures using soft set theory are very rapidly developed.
11,175
all subjects Samples fourth and the anchors were concatenated for along dimension.
Samples for all anchors and subjects were concatenated along the fourth dimension.
11,176
inference mechanism is on An Birds Angry domain. the ensemble proposed
An ensemble inference mechanism is proposed on the Angry Birds domain.
11,177
model online the is to according performed parameters. Learning an estimation strategy procedure for
Learning procedure is performed according to an online estimation strategy for the model parameters.
11,178
changes on the the environment in We exerting which selection case stochastically. focus
We focus on the case in which the environment exerting selection changes stochastically.
11,179
therefore detect propose We it. experimental observable an to
We therefore propose an experimental observable to detect it.
11,180
genetic linked one site at selection shapes sites. of patterns variation at Natural
Natural selection at one site shapes patterns of genetic variation at linked sites.
11,181
from substantial linked of a inference suggests effect selection non-classic Our further sweeps.
Our inference further suggests a substantial effect of linked selection from non-classic sweeps.
11,182
face pre-processing, performance with data anti-spoofing some Combined drastically. the improves
Combined with some data pre-processing, the face anti-spoofing performance improves drastically.
11,183
provides memory patterns. basis conclusion maintaining Another mathematical concept or for a
Another mathematical conclusion provides a basis for maintaining memory or concept patterns.
11,184
can itself The space processes. through automatic self-organisation
The self-organisation can space itself through automatic processes.
11,185
might The structures afterwards. help with also memory finding process
The process might also help with finding memory structures afterwards.
11,186
model conclusions. and new version This further cognitive the extended with some integrates provides existing
This extended version integrates further with the existing cognitive model and provides some new conclusions.
11,187
analysis sex of of revealed the a number Our in recombination. distribution differences
Our analysis revealed a number of sex differences in the distribution of recombination.
11,188
commonly images. Complex exist natural in structures
Complex structures commonly exist in natural images.
11,189
methods. forms issue prior The fundamental challenge a for
The issue forms a fundamental challenge for prior methods.
11,190
scales. patch varying sizes downsizing region-based Different or images, measure we from
Different from varying patch sizes or downsizing images, we measure region-based scales.
11,191
model, inference is map. single-scale a selected obtain Through saliency our to information
Through our inference model, single-scale information is selected to obtain a saliency map.
11,192
improves cannot on images well traditionally. detection that handled many Our be method quality
Our method improves detection quality on many images that cannot be handled well traditionally.
11,193
method based bootstrap embeddings hypothesis for on kernel nonparametric proposed. tests is distribution wild A
A wild bootstrap method for nonparametric hypothesis tests based on kernel distribution embeddings is proposed.
11,194
makes potentially object for number them learning classes. and recognizing a higher suitable of This
This makes them potentially suitable for learning and recognizing a higher number of object classes.
11,195
takes learns The contour approach spatial frequent simple and their configurations. fragments
The approach takes simple contour fragments and learns their frequent spatial configurations.
11,196
effective Shannon method entropy. fuzzy and facial using theory suggests paper for This recognition an
This paper suggests an effective method for facial recognition using fuzzy theory and Shannon entropy.
11,197
entropy the theory of Combination methods. fuzzy other complication and Shannon eliminates of
Combination of fuzzy theory and Shannon entropy eliminates the complication of other methods.
11,198
scheduling programming. cumulative environments, uncertain in using investigate constraint We
We investigate cumulative scheduling in uncertain environments, using constraint programming.
11,199