text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
individuals in ASD short-range lateral-frontal with electrodes. showed increased connections Conversely,
Conversely, individuals with ASD showed increased short-range connections in lateral-frontal electrodes.
2,100
these special Both contain of Gaussian a the classes as case.
Both of these classes contain the Gaussian as a special case.
2,101
that paper biochemical cells can living multiplex In signals, this i.e. we show
In this paper we show that living cells can multiplex biochemical signals, i.e.
2,102
these The an heuristics application of in scheme. branching results adaptive
The application of these heuristics results in an adaptive branching scheme.
2,103
pathway This determining and to research powerful extinction provides for extinction. the times characterizing tools
This research provides powerful tools for determining extinction times and characterizing the pathway to extinction.
2,104
been For heuristics purpose proposed. numerous have this
For this purpose numerous heuristics have been proposed.
2,105
on based Results in failures more demonstrate heuristics general efficient. that are
Results demonstrate that heuristics based on failures are in general more efficient.
2,106
in role Homologous recombination genetic key functionality. generating while protein plays a diversity, maintaining
Homologous recombination plays a key role in generating genetic diversity, while maintaining protein functionality.
2,107
DNA length sharply. to above sensitivity is There heterology the decreases a which characteristic
There is a characteristic DNA length above which the sensitivity to heterology decreases sharply.
2,108
observable neuronal non-stationary This manifested is every in feature. behavior response of practically variability
This variability is manifested in non-stationary behavior of practically every observable neuronal response feature.
2,109
authentication and The to develop biometric systems. is physiological employed behavioral trait
The physiological and behavioral trait is employed to develop biometric authentication systems.
2,110
connected preprocessed on components. are The area based the patterns of iris
The iris patterns are preprocessed based on area of the connected components.
2,111
is image region quadtree components. split The into
The image region is split into quadtree components.
2,112
variance training minimum the from samples. determined components with The are
The components with minimum variance are determined from the training samples.
2,113
components. on moments applied Hu the are
Hu moments are applied on the components.
2,114
biometric, signature natural a expectation. variations case, The in is is a where a genuine
The signature is a biometric, where variations in a genuine case, is a natural expectation.
2,115
the one In instance from signature, genuine of certain to parts signature another. vary
In the genuine signature, certain parts of signature vary from one instance to another.
2,116
is area its challenging research and creativity complexity. for development a Web
Web development is a challenging research area for its creativity and complexity.
2,117
In we and how variability. multiplicity operator affect strength this show operator particular,
In particular, we show how operator strength and operator multiplicity affect this variability.
2,118
all network and (i.e. functional interactions modules This contains known
This network contains all known interactions and functional modules (i.e.
2,119
entry. proteins) groups to responding coordinately HCMV of
groups of proteins) coordinately responding to HCMV entry.
2,120
further novel are being Nonetheless, in literature. proposed functions
Nonetheless, further novel functions are being proposed in literature.
2,121
We kernel propose for based a handwritten nearest classification. digit simple approach neighbor
We propose a simple kernel based nearest neighbor approach for handwritten digit classification.
2,122
two here a The defining similarity between is "distance" kernel images. the actually
The "distance" here is actually a kernel defining the similarity between two images.
2,123
be concatenating "normalized compression by estimated zipping the distance". MI can sequences, and thereby yielding
MI can be estimated by concatenating and zipping sequences, yielding thereby the "normalized compression distance".
2,124
but results, uncontrolled this with errors. produced has far promising So
So far this has produced promising results, but with uncontrolled errors.
2,125
of from get describe to robust simple pairwise global a MI approach We estimates alignments.
We describe a simple approach to get robust estimates of MI from global pairwise alignments.
2,126
virtue see the in way. more of general our a we approach But main
But we see the main virtue of our approach in a more general way.
2,127
are Cascade in widely used object classifiers detection. real-time
Cascade classifiers are widely used in real-time object detection.
2,128
a that LAC. of cost We directly function optimizes algorithm new boosting design then the
We then design a new boosting algorithm that directly optimizes the cost function of LAC.
2,129
in column totally-corrective technique implemented resulting boosting algorithm by is convex The the optimization. generation
The resulting totally-corrective boosting algorithm is implemented by the column generation technique in convex optimization.
2,130
a large Motivation: variety Signaling control processes. pathways of cellular
Motivation: Signaling pathways control a large variety of cellular processes.
2,131
analyses and makes cross-talk difficult. comparative This
This makes comparative and cross-talk analyses difficult.
2,132
the cancer-specific cross-talks profiles. possible and expression activity We and quantified found tissue- pathway-specific of
We quantified the possible tissue- and cancer-specific activity of cross-talks and found pathway-specific expression profiles.
2,133
of signaling We for novel pathways. a comparative provide and analyses Conclusions: cross-talk resource
Conclusions: We provide a novel resource for comparative and cross-talk analyses of signaling pathways.
2,134
of human-computer a interaction. in focus been Object research detection has
Object detection has been a focus of research in human-computer interaction.
2,135
at out. dies simulate what difference level We population the required of
We simulate at what level of required difference the population dies out.
2,136
images becoming Searching and tedious the image querying the difficult. related is by
Searching the related images by the querying image is becoming tedious and difficult.
2,137
demonstrate results Experimental existing superiority the techniques. with its
Experimental results demonstrate its superiority with the existing techniques.
2,138
is aiming causal formalism Our from information. a at causal example capturing explanations
Our example is a formalism aiming at capturing causal explanations from causal information.
2,139
efficiency of show relative and naturalness We the job. translation this
We show the naturalness and relative efficiency of this translation job.
2,140
an for in interested program. the ASP writing We ease are
We are interested in the ease for writing an ASP program.
2,141
translation. show facilitate ASP the We working improvements how recent in systems
We show how recent improvements in working ASP systems facilitate the translation.
2,142
ovary. nongrowing the follicles is reserve (NGFs) of the in by population ovarian defined Human
Human ovarian reserve is defined by the population of nongrowing follicles (NGFs) in the ovary.
2,143
the prepared tissue. identification of NGFs Direct estimation ovarian involves ovarian reserve in of
Direct estimation of ovarian reserve involves the identification of NGFs in prepared ovarian tissue.
2,144
estimated al. using (C is error concordance Prediction index) index et Harrell's [Harrell
Prediction error is estimated using Harrell's concordance index (C index) [Harrell et al.
2,145
also for accounts The censoring. C-index specifically
The C-index also specifically accounts for censoring.
2,146
KIRSF functions, kernel utilizing many RSF By better situations. achieves in than results
By utilizing kernel functions, KIRSF achieves better results than RSF in many situations.
2,147
functions this into we how show kernel In report, to RSF. incorporate
In this report, we show how to incorporate kernel functions into RSF.
2,148
method our to KIRSF of and RSF. compare test We performance the
We test the performance of KIRSF and compare our method to RSF.
2,149
better We than in performance RSF occasions. that many find is KIRSF's the
We find that the KIRSF's performance is better than RSF in many occasions.
2,150
of significantly. performance the finished the These solver affect decisions
These decisions affect the performance of the finished solver significantly.
2,151
a We the alldifferent use constraint case study. as
We use the alldifferent constraint as a case study.
2,152
of A risk a essentially functional. wide learning variety regularized machine minimize problems
A wide variety of machine learning problems essentially minimize a regularized risk functional.
2,153
emerges by A picture and studying clearer Normal model. simpler the means
A clearer and simpler picture emerges by studying the Normal means model.
2,154
hidden the statistical states of units However, resulting dependencies. exhibit
However, the resulting states of hidden units exhibit statistical dependencies.
2,155
RBMs. regularizer group} We \emph{sparse trained RBMs with call the
We call RBMs trained with the regularizer \emph{sparse group} RBMs.
2,156
process is global in companies. a Management Knowledge
Knowledge Management is a global process in companies.
2,157
our knitting industry. We approach apply on
We apply our approach on knitting industry.
2,158
of maxRPC performance this boost In propose algorithms. techniques paper the that we can
In this paper we propose techniques that can boost the performance of maxRPC algorithms.
2,159
closely algorithms. two propose Based these, related we on
Based on these, we propose two closely related algorithms.
2,160
it call the We algorithm. MH random dive (RDMH)
We call it the random dive MH (RDMH) algorithm.
2,161
convergence (ergodicity) basic ensure kernel. of These the
These ensure basic convergence (ergodicity) of the kernel.
2,162
constraint propose problem. We of the the modifies model a which new approach,
We propose a new approach, which modifies the constraint model of the problem.
2,163
search are out imposed the that constraints done. already additional Optionally, rule
Optionally, additional constraints are imposed that rule out the search already done.
2,164
new models believable method develop to for conclude a we agents. two-step To propose
To conclude we propose a two-step method to develop new models for believable agents.
2,165
algorithm designed. be model the learning can Then the and
Then the model and the learning algorithm can be designed.
2,166
combinational and do better However, methods guarantee the result. not integration this
However, this integration and the combinational methods do not guarantee better result.
2,167
methods these feature and extracted accuracy. set for from The obtained tested compared were
The extracted feature set obtained from these methods were compared and tested for accuracy.
2,168
behaviours well work to are They new believable validate suited on models.
They are well suited to validate work on new believable behaviours models.
2,169
agents' improve However, implementation, experiments numerous can the believability. help during to
However, during the implementation, numerous experiments can help to improve agents' believability.
2,170
although, can our difficult. experiment, analysis as promising shown be method This in results' seems
This method seems promising although, as shown in our experiment, results' analysis can be difficult.
2,171
and network multiple capacity. study the We patterns store
We store multiple patterns and study the network capacity.
2,172
possible. is fitness evolution moderate optimisation For rates, still change through
For moderate change rates, fitness optimisation through evolution is still possible.
2,173
overcomes shock down break when level. systems resistance These some given a
These systems break down when some shock overcomes a given resistance level.
2,174
used addition, commonly and angular, evaluated. analyzed (Minkowski, and In directional-distance) measures are distance
In addition, commonly used distance measures (Minkowski, angular, and directional-distance) are analyzed and evaluated.
2,175
filter choose how a requirements. given Finally, certain suggestions on to are provided
Finally, suggestions are provided on how to choose a filter given certain requirements.
2,176
used in transformations applications. Color processing, image graphics, visualization and frequently are space
Color space transformations are frequently used in image processing, graphics, and visualization applications.
2,177
activate post-synaptic such as A diffusing that glutamate neuron receptors. pre-synaptic neurotransmitters releases
A pre-synaptic neuron releases diffusing neurotransmitters such as glutamate that activate post-synaptic receptors.
2,178
involves contextual classifier. decision method tree classification using pixel The a
The method involves contextual pixel classification using a decision tree classifier.
2,179
plays role detecting Accurately pedestrians a computer critically applications. in vision in many images important
Accurately detecting pedestrians in images plays a critically important role in many computer vision applications.
2,180
effective the Extraction of is task. this to features key
Extraction of effective features is the key to this task.
2,181
compute. and robust Promising features to be discriminative, should various easy variations to
Promising features should be discriminative, robust to various variations and easy to compute.
2,182
standard The Ojala proposed et by al. LBP
The standard LBP proposed by Ojala et al.
2,183
The feature, information. CS-LBP texture proposed captures the information some gradient and in contrast,
The proposed CS-LBP feature, in contrast, captures the gradient information and some texture information.
2,184
operators their have use very time-critical requirements often applications. which in high computational limits These
These operators often have very high computational requirements which limits their use in time-critical applications.
2,185
minimax speed approximation vector theory. up paper This introduces the using to filters techniques
This paper introduces techniques to speed up vector filters using the minimax approximation theory.
2,186
alternatives Minkowski fact strong to The metrics. demonstrate are popular the that there in results
The results demonstrate that there are in fact strong alternatives to the popular Minkowski metrics.
2,187
first step the this Border in often is detection analysis.
Border detection is often the first step in this analysis.
2,188
thresholding approximate of lesion ensemble then location an the algorithms. determined The of is using
The approximate location of the lesion is then determined using an ensemble of thresholding algorithms.
2,189
to speed these methods filters. we this up introduce In two paper,
In this paper, we introduce two methods to speed up these filters.
2,190
with ability the feedback. computer to endows This the to interaction user's adapt certain
This interaction endows the computer with certain ability to adapt to the user's feedback.
2,191
to and shown presented caluculations Also indeed. are these be numerical are invariants useful
Also numerical caluculations are presented and these invariants are shown to be useful indeed.
2,192
Levesque knowledge of base. precisely introduced the only-knowing beliefs the a of capture to notion
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base.
2,193
ideas their first-order also to a case. clear not generalize is It to how
It is also not clear how to generalize their ideas to a first-order case.
2,194
discuss Lakemeyer. by We the Halpern and to approach comparisons earlier also
We also discuss comparisons to the earlier approach by Halpern and Lakemeyer.
2,195
Two regret bounds developed. surrogate to are approaches
Two approaches to surrogate regret bounds are developed.
2,196
generalization et a al. Bartlett The of first direct is
The first is a direct generalization of Bartlett et al.
2,197
exponential, hinge, sigmoid detail. losses The in squared treated then are uneven error, and
The uneven hinge, squared error, exponential, and sigmoid losses are then treated in detail.
2,198
hashing to process an vector Image is of bits associating image. short a the of
Image hashing is the process of associating a short vector of bits to an image.
2,199