Datasets:
damilojohn
/
Text-Descrambling

Dataset card Data Studio Files
xet
 Community
text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
a clone often one target of chemo-treatments Current tumor.
Current chemo-treatments often target one clone of a tumor.
11,300
reoccurs. the tumor kills clone, drug and other the that it clones Although overtake
Although the drug kills that clone, other clones overtake it and the tumor reoccurs.
11,301
We call for proposed (GCFF). the Graph-Cuts F-formation method
We call the proposed method Graph-Cuts for F-formation (GCFF).
11,302
noise from fluctuations study rates. arising residue-specific translational in elongation This analyzes
This study analyzes translational noise arising from fluctuations in residue-specific elongation rates.
11,303
the contingency models Log-linear tables. workhorses are of analyzing popular
Log-linear models are the popular workhorses of analyzing contingency tables.
11,304
represent subtype-specific which identified, potentially mechanisms underlying Two tumorigenesis. core-signaling were networks
Two subtype-specific networks were identified, which potentially represent core-signaling mechanisms underlying tumorigenesis.
11,305
targets, effectively predicted subtype-specific networks validated. experimentally which drug Further, the were
Further, the networks effectively predicted subtype-specific drug targets, which were experimentally validated.
11,306
for optical presented work. edge in in segmentation detector image is this quantum A environments
A quantum edge detector for image segmentation in optical environments is presented in this work.
11,307
is presented A same version detector the Boolean of too.
A Boolean version of the same detector is presented too.
11,308
edge detector computational new with the states, version quantum basis The exclusively. works of
The quantum version of the new edge detector works with computational basis states, exclusively.
11,309
outside so far quantum Said too. to processing algorithms is image extended
Said so far is extended to quantum algorithms outside image processing too.
11,310
However, although are they the equally are results quantum valid. different,
However, although they are different, the quantum results are equally valid.
11,311
the is simulations clearly in seen latter . The computer
The latter is clearly seen in the computer simulations .
11,312
as have generality more explored markers reduced. consciousness specificity Moreover, was stimulus here the
Moreover, the consciousness markers explored here have more generality as stimulus specificity was reduced.
11,313
and systems. feature ubiquitous a complex is in nature fundamental Variability of
Variability is ubiquitous in nature and a fundamental feature of complex systems.
11,314
genetic itself variance a studies, investigated have as control. however, trait Few under
Few studies, however, have investigated variance itself as a trait under genetic control.
11,315
the degree heritable. demonstrate that itself We variability of is
We demonstrate that the degree of variability is itself heritable.
11,316
validated We alleles, deficiencies, genetic have transgenes. and results inducible null RNAi using these
We have validated these results using genetic deficiencies, null alleles, and inducible RNAi transgenes.
11,317
for other data types of However, (e.g.
However, for other types of data (e.g.
11,318
involves Protein changes. function conformational binding often and
Protein binding and function often involves conformational changes.
11,319
was two shown The earlier. existence two rigid structures dimensional of
The existence of two rigid two dimensional structures was shown earlier.
11,320
detection. networks for multi-stage deformable In deep object paper, this propose neural and convolutional we
In this paper, we propose multi-stage and deformable deep convolutional neural networks for object detection.
11,321
has learning aspects. multiple This diagram innovations detection new deep in object
This new deep learning object detection diagram has innovations in multiple aspects.
11,322
extensive component-wise also is experimental Detailed analysis evaluation. provided through
Detailed component-wise analysis is also provided through extensive experimental evaluation.
11,323
image analysis from useful method to information basic matching in images. Template is extract a
Template matching is a basic method in image analysis to extract useful information from images.
11,324
paper, In new a we method pattern for matching. suggest this
In this paper, we suggest a new method for pattern matching.
11,325
dimensional dimensional template from two the image into method image Our one transform vector.
Our method transform the template image from two dimensional image into one dimensional vector.
11,326
movie viewing of data. presented real-world on results art the are State
State of the art results are presented on real-world movie viewing data.
11,327
interplay speciation trophic structure interactions. and emerges the food-web between from The dynamical thereby
The food-web structure thereby emerges from the dynamical interplay between speciation and trophic interactions.
11,328
coupled introduce by webs on We of metacommunity several evolutionary food multitrophic an habitats migration.
We introduce an evolutionary metacommunity of multitrophic food webs on several habitats coupled by migration.
11,329
between Additionally, to able migrate species the are habitats.
Additionally, species are able to migrate between the habitats.
11,330
detection the problem binary each as This classification of target IR pixel. study a formulates
This study formulates the IR target detection as a binary classification problem of each pixel.
11,331
of labeled models parameters learned these are from The MRF examples.
The parameters of these MRF models are learned from labeled examples.
11,332
is incorporating performance improved detection further temporal background by The information subtraction. through
The detection performance is further improved by incorporating temporal information through background subtraction.
11,333
this benchmark datasets for IR method effectiveness target detection. of demonstrate performances High on
High performances on benchmark datasets demonstrate effectiveness of this method for IR target detection.
11,334
this automated The machinery contribution mediation is the does that. which paper of
The contribution of this paper is the automated mediation machinery which does that.
11,335
method study case used comparison an it the with earlier in a For work. illustrates
For comparison it illustrates the method with a case study used in an earlier work.
11,336
descriptor image property structure. not give ownership This does the of local
This descriptor property does not give ownership of the local image structure.
11,337
to has clinical improve tests for osteoporosis method the potential This pathologies. diagnostics
This method has the potential to improve clinical diagnostics tests for osteoporosis pathologies.
11,338
requires variables estimation completely of s-sparse The measurements. just with many independent as signals
The estimation of s-sparse signals with completely independent variables requires just as many measurements.
11,339
fundamental metrics analysis network Network toolbox. form the of a part
Network metrics form a fundamental part of the network analysis toolbox.
11,340
learning. machine In this metrics probabilistic work, connect network we modern to
In this work, we connect network metrics to modern probabilistic machine learning.
11,341
formulate we node eigenvector-based importance. Bayesian determining centrality First, for an model
First, we formulate an eigenvector-based Bayesian centrality model for determining node importance.
11,342
Gaussian bridge We model processes. to then this sparse
We then bridge this model to sparse Gaussian processes.
11,343
process. jump the methods from ability Such require trajectories conditioned to the simulate ostensibly
Such methods ostensibly require the ability to simulate trajectories from the conditioned jump process.
11,344
therefore improving conditioned processes. the jump efficiency three for of methods We propose simulating
We therefore propose three methods for improving the efficiency of simulating conditioned jump processes.
11,345
We sequential also to our problem. adapt recently Monte Carlo a scheme proposed
We also adapt a recently proposed sequential Monte Carlo scheme to our problem.
11,346
We approach, the of MJP. two this two based implementations approximations of continuous consider on
We consider two implementations of this approach, based on two continuous approximations of the MJP.
11,347
and state-of-the-art. of the validate real-world the against performance method our on We synthetic data
We validate the performance of our method on synthetic and real-world data against the state-of-the-art.
11,348
edge to matching an of We use potential region. technique the unknown structure infer the
We use an edge matching technique to infer the potential structure of the unknown region.
11,349
structure, the texture curves. estimated by along synthesis the automatically Driven estimated performed is
Driven by the estimated structure, texture synthesis is performed automatically along the estimated curves.
11,350
results approach favorable this techniques. show that existing state-of-the-art experiments outperform that Our achieves
Our experiments show that this approach achieves favorable results that outperform existing state-of-the-art techniques.
11,351
the an for in we algorithm raw deflectometric devise of Furthermore, interest object images. detecting
Furthermore, we devise an algorithm for detecting the object of interest in raw deflectometric images.
11,352
gain to Experiments of previous methods. significant measurements a suggest in compared coverage single
Experiments suggest a significant gain of coverage in single measurements compared to previous methods.
11,353
on data To will research facilitate publicly our set reconstruction, make available. specular surface we
To facilitate research on specular surface reconstruction, we will make our data set publicly available.
11,354
Carlo introduce estimation which new class of exact Monte a we algorithms. methods, call We
We introduce a new class of Monte Carlo methods, which we call exact estimation algorithms.
11,355
differing parameters. structures In optimization, of often Bayesian with we over practical search numbers must
In practical Bayesian optimization, we must often search over structures with differing numbers of parameters.
11,356
to our on adapted case. min-max principle is Courant-Fischer It the based
It is based on the Courant-Fischer min-max principle adapted to our case.
11,357
causal The is shown techniques proposed state-of-the-art inference. method be to competitive for with
The proposed method is shown to be competitive with state-of-the-art techniques for causal inference.
11,358
generates embedded agglomerative an idea self-taught hypotheses. that into localization clustering technique is This
This idea is embedded into an agglomerative clustering technique that generates self-taught localization hypotheses.
11,359
function Tukey one robust multivariate the purposes. serving depth famous most is of tools
Tukey depth function is one of the most famous multivariate tools serving robust purposes.
11,360
combinatorial In issue algorithms. this by address this we paper, presenting computing two
In this paper, we address this computing issue by presenting two combinatorial algorithms.
11,361
faster run existing minimal ones. and Both very than memory the much require
Both require very minimal memory and run much faster than the existing ones.
11,362
the All Tukey they that indicate depth. experiments exact compute
All experiments indicate that they compute the exact Tukey depth.
11,363
the a straightforward based of problem presented. study on analysis theory this probability In is
In this study a straightforward analysis of the problem based on probability theory is presented.
11,364
computer features shown vision. performance in have mid-level promising Recently,
Recently, mid-level features have shown promising performance in computer vision.
11,365
limb's are combined Secondly, part and limbs into the are parts mapped into states states.
Secondly, limbs are combined into parts and the limb's states are mapped into part states.
11,366
as or parts Local Frequent FLPs. These referred to are Parts
These parts are referred to as Frequent Local Parts or FLPs.
11,367
powerful The bag-of-FLP-based to representation. build us action allow FLPs
The FLPs allow us to build powerful bag-of-FLP-based action representation.
11,368
these this gaps. With fill to we intend paper,
With this paper, we intend to fill these gaps.
11,369
can recognition? the How represented be for efficiently in memory object
How can the object be efficiently represented in memory for recognition?
11,370
extracted? How information be semantic can reliably
How reliably can semantic information be extracted?
11,371
the to from finally: are query the pipeline What And in factors limiting semantics? resulting
And finally: What are the limiting factors in the resulting pipeline from query to semantics?
11,372
other higher than method, the accuracy we fuzzy obtain methods. Using
Using the fuzzy method, we obtain higher accuracy than other methods.
11,373
experimentally and VOC. validate We it PASCAL DPM the model call DeepPyramid resulting on
We call the resulting model DeepPyramid DPM and experimentally validate it on PASCAL VOC.
11,374
we the wave find that Additionally, of spontaneous generation activity. supports the spiral system
Additionally, we find that the system supports the spontaneous generation of spiral wave activity.
11,375
are from experiments. in vitro both with qualitatively and quantitatively observations results Our consistent
Our results are both qualitatively and quantitatively consistent with observations from in vitro experiments.
11,376
imagery matching different face across to (HFR) face domains. recognition refers Heterogeneous
Heterogeneous face recognition (HFR) refers to matching face imagery across different domains.
11,377
in recent techniques HFR. a comprehensive established developments of review survey This and provides
This survey provides a comprehensive review of established techniques and recent developments in HFR.
11,378
of a detailed commonly and account we datasets benchmarks Moreover, offer for used evaluation.
Moreover, we offer a detailed account of datasets and benchmarks commonly used for evaluation.
11,379
a we In paper, present alignment. this approach regression deep face for
In this paper, we present a deep regression approach for face alignment.
11,380
global consists of a deep and The layers. local architecture multi-stage layer
The deep architecture consists of a global layer and multi-stage local layers.
11,381
the parameters. back-propagation with dropout We optimize to regression apply jointly the algorithm strategy the
We apply the back-propagation algorithm with the dropout strategy to jointly optimize the regression parameters.
11,382
Experimental state-of-the-art show the . our approach achieves results that
Experimental results show that our approach achieves the state-of-the-art .
11,383
the a study self-replicating We problem scheduling of factory.
We study the scheduling problem of a self-replicating factory.
11,384
is scheduled several allowing lines in self-replication production to run parallel. Optimally by facilitated
Optimally scheduled self-replication is facilitated by allowing several production lines to run in parallel.
11,385
is of analysis Object datasets objects. statistical (OODA) data oriented the analysis of complex
Object oriented data analysis (OODA) is the statistical analysis of datasets of complex objects.
11,386
contact data function news, be rate can easily of LPMs estimated. From the closing
From data of LPMs closing news, the contact rate function can be easily estimated.
11,387
Horner's method To be can end, used. this
To this end, Horner's method can be used.
11,388
optimal MCTS reported Recently, to to was find be able near schemes.
Recently, MCTS was reported to be able to find near optimal schemes.
11,389
had parameters However, to fine-tuned manually. several be
However, several parameters had to be fine-tuned manually.
11,390
only the a as We neighborhood time allowed computation leaving structure, suitable a found parameter.
We found a suitable neighborhood structure, leaving only the allowed computation time as a parameter.
11,391
obtained by results are better similar by obtained those or SLS than The MCTS.
The results obtained by SLS are similar or better than those obtained by MCTS.
11,392
of population a consequence a drift. Over genetic substitutions as random acquires neutral time,
Over time, a population acquires neutral genetic substitutions as a consequence of random drift.
11,393
then across rates u$. are birth uniform \leq If $K sites,
If birth rates are uniform across sites, then $K \leq u$.
11,394
Our to a model variety population of applied can structures. be
Our model can be applied to a variety of population structures.
11,395
genetic we in example, In the of the accumulation small one investigate intestine. mutations
In one example, we investigate the accumulation of genetic mutations in the small intestine.
11,396
in are probability. Parse reported then decreasing trees order of
Parse trees are then reported in order of decreasing probability.
11,397
Forecasting and may health inform these efforts. simulation interventions public of
Forecasting and simulation of these interventions may inform public health efforts.
11,398
resources address will to commitment A and support long-term of the necessary outbreak. be
A long-term commitment of resources and support will be necessary to address the outbreak.
11,399