text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
usually views. extracted descriptors are these Multiple different to represent
Multiple descriptors are usually extracted to represent these different views.
10,400
is contributing step the that every final We conclude rate. for recognition to crucial
We conclude that every step is crucial for contributing to the final recognition rate.
10,401
concerned for $\alpha$-stable is volatility paper models. filtering particle with This stochastic
This paper is concerned with particle filtering for $\alpha$-stable stochastic volatility models.
10,402
fruit industry economic cause losses agricultural in Diseases and worldwide. in production devastating in problem
Diseases in fruit cause devastating problem in economic losses and production in agricultural industry worldwide.
10,403
play de in suggest important that strongly protein novo results These role lncRNAs evolution. an
These results strongly suggest that lncRNAs play an important role in de novo protein evolution.
10,404
for plays Computer Inter-frame role and Compression video Vision. Coding significant
Inter-frame Coding plays significant role for video Compression and Computer Vision.
10,405
systems (e.g. vision life many been applications have in incorporated Computer real
Computer vision systems have been incorporated in many real life applications (e.g.
10,406
medical surveillance robot systems, identity navigation and systems). verification imaging,
surveillance systems, medical imaging, robot navigation and identity verification systems).
10,407
two until AFSA, these the algorithm termination. standard constant In remain parameters
In standard AFSA, these two parameters remain constant until the algorithm termination.
10,408
evaluated on based been the proposed well-known have The four approaches functions. benchmark
The proposed approaches have been evaluated based on the four well-known benchmark functions.
10,409
the AFSA. of Experimental results show positive considerable impact on performance
Experimental results show considerable positive impact on the performance of AFSA.
10,410
for novel mechanism We propose a concentrating urine.
We propose a novel mechanism for concentrating urine.
10,411
hypothesis feasibility the of the proposed. to is An testing approach
An approach to testing the feasibility of the hypothesis is proposed.
10,412
algorithm determine circles of parameters candidates. edge to combination uses a as points three The
The algorithm uses a combination of three edge points as parameters to determine circles candidates.
10,413
actually candidates are determines reinforcement the at A if signal such circle present image.
A reinforcement signal determines if such circle candidates are actually present at the image.
10,414
a fast is complicated multiple-circle facing The conditions. overall approach despite detector
The overall approach is a fast multiple-circle detector despite facing complicated conditions.
10,415
we $a$ article, necessarily $b$ consider In and independent. not this
In this article, we consider $a$ and $b$ not necessarily independent.
10,416
result can spatial metastable between indicates states. that transitions the Our structure accelerate
Our result indicates that spatial structure can accelerate the transitions between metastable states.
10,417
informative individuals. often features differences group-wise However, of are assessing less for
However, group-wise differences are often less informative for assessing features of individuals.
10,418
has composition been studied. Second, clusters those of the clade
Second, the clade composition of those clusters has been studied.
10,419
shrinkage between step The quadratic proposed and non-local a subproblem. alternates a algorithm
The proposed algorithm alternates between a non-local shrinkage step and a quadratic subproblem.
10,420
shrinkage derive penalties relevant non-local that regularization. for are several We rules analytical in
We derive analytical shrinkage rules for several penalties that are relevant in non-local regularization.
10,421
resulting non-local be alternating algorithms. current considerably is than faster The algorithm observed to
The resulting algorithm is observed to be considerably faster than current alternating non-local algorithms.
10,422
(DGSM) this global The measures} sensitivity in been developed {\em recently derivative-based respect. have
The {\em derivative-based global sensitivity measures} (DGSM) have been developed recently in this respect.
10,423
analytical requires of PC orthonormal which of expansions. derivatives enter This polynomials the derivation the
This requires the analytical derivation of derivatives of the orthonormal polynomials which enter PC expansions.
10,424
efficiency on The sensitivity in of two illustrated well-known benchmark problems analysis. approach the is
The efficiency of the approach is illustrated on two well-known benchmark problems in sensitivity analysis.
10,425
The reasoning. a which algorithm paper presents employs detection such fuzzy corner
The paper presents a corner detection algorithm which employs such fuzzy reasoning.
10,426
events. a bulb olfactory thus odor is an sharp The to of sequence response
The olfactory bulb response to an odor is thus a sequence of sharp events.
10,427
is discrete a an odor Thus, the signature sequence. of
Thus, the signature of an odor is a discrete sequence.
10,428
efficient clusters, a number Hierarchical an Clustering algorithm determine proposed. of is (SHC) Semi-supervised To
To determine an efficient number of clusters, a Semi-supervised Hierarchical Clustering (SHC) algorithm is proposed.
10,429
To end, is this Direct Computation Vector proposed. a algorithm Fiedler
To this end, a Direct Fiedler Vector Computation algorithm is proposed.
10,430
is consider based graph data not does structure the cut and on The labels.
The graph cut is based on the data structure and does not consider labels.
10,431
used to Labels define criterion only cut. are graph the for stopping
Labels are used only to define the stopping criterion for graph cut.
10,432
five algorithms on image-set state-of-the-art The standard datasets. proposed algorithm classification outperformed
The proposed algorithm outperformed state-of-the-art image-set classification algorithms on five standard datasets.
10,433
learning in involved understood. not processes cortical are The well
The cortical processes involved in learning are not well understood.
10,434
the adaptation. findings formation during assemblies cell of have Initial suggested
Initial findings have suggested the formation of cell assemblies during adaptation.
10,435
work hierarchical Bayesian is this fact, network. based on dynamic In a
In fact, this work is based on a dynamic hierarchical Bayesian network.
10,436
using semantic and vision Computer are defined tasks evaluated categories. traditionally
Computer vision tasks are traditionally defined and evaluated using semantic categories.
10,437
single classification steps in and algorithm. approach clustering a unifies the Our proposed
Our proposed approach unifies the clustering and classification steps in a single algorithm.
10,438
qualitatively results. this and quantitatively we significant Following approach show both
Following this approach we show both qualitatively and quantitatively significant results.
10,439
distribution. the visual tail long that a We show subclasses demonstrate
We show that the visual subclasses demonstrate a long tail distribution.
10,440
detection of object state methods show we Finally, that art the (e.g.
Finally, we show that state of the art object detection methods (e.g.
10,441
image stages are different processing. of being at techniques widely used satellite Resampling
Resampling techniques are being widely used at different stages of satellite image processing.
10,442
rules. structure of if-then non-redundant minimal and explore We sets consisting graded of the
We explore the structure of non-redundant and minimal sets consisting of graded if-then rules.
10,443
plays most applications. role in important an Change detection video-based
Change detection plays an important role in most video-based applications.
10,444
judgments study problem of be can how We such aggregated. multiple the
We study the problem of how multiple such judgments can be aggregated.
10,445
domain. adapting for the define properties classical problem argumentation social-choice-theoretic by various We the
We define the problem by adapting various classical social-choice-theoretic properties for the argumentation domain.
10,446
speckle on presents wavelet paper The transform. real and time based activity computation algorithm de-noising
The paper presents real time speckle de-noising based on activity computation algorithm and wavelet transform.
10,447
illuminated from arise an an Speckles laser in surface. light when is image reflected
Speckles arise in an image when laser light is reflected from an illuminated surface.
10,448
FPGA can Programmable Gate in implemented The (Field be Array) technology. project
The project can be implemented in FPGA (Field Programmable Gate Array) technology.
10,449
is detecting reliable In for method images faces proposed. human paper, this in a color
In this paper, a reliable method for detecting human faces in color images is proposed.
10,450
adjusting The is are given results circuit implemented of out. simulation some and real-time
The real-time adjusting circuit is implemented and some of simulation results are given out.
10,451
suggest several focus we for Therefore, sectors. experimental SCA which shifting the to identifies proteins
Therefore, we suggest shifting the experimental focus to proteins for which SCA identifies several sectors.
10,452
high created energy need in to the computational capacity. have physics increase Advances
Advances in high energy physics have created the need to increase computational capacity.
10,453
composed challenge. Project this HEPGAME was to address
Project HEPGAME was composed to address this challenge.
10,454
and We have these simplify using common investigated to ways subexpression expressions, schemes elimination. Horner
We have investigated ways to simplify these expressions, using Horner schemes and common subexpression elimination.
10,455
applies search Our AI. has in been a procedure successful approach MCTS, that
Our approach applies MCTS, a search procedure that has been successful in AI.
10,456
use We schemes. to near-optimal find it Horner
We use it to find near-optimal Horner schemes.
10,457
Although this rise further finds approach MCTS gives two challenges. to solutions, better
Although MCTS finds better solutions, this approach gives rise to two further challenges.
10,458
manually. has to be constant This tuned
This constant has to be tuned manually.
10,459
revealed connectivity wider repertoire during approach of states This control than post-psilocybin a conditions.
This approach revealed a wider repertoire of connectivity states post-psilocybin than during control conditions.
10,460
is detection a Face recognition. basic task expression for
Face detection is a basic task for expression recognition.
10,461
detection recognition. ways There to several are face undergo &
There are several ways to undergo face detection & recognition.
10,462
or Operations, the Processing classifiers, virtual can We filters use various machines former. for Image
We can use Image Processing Operations, various classifiers, filters or virtual machines for the former.
10,463
are Facial available Various Expression strategies for Detection. being
Various strategies are being available for Facial Expression Detection.
10,464
these Local popularity have gained years. Binary Pattern based texture in algorithms (LBP)
Local Binary Pattern (LBP) based texture algorithms have gained popularity in these years.
10,465
expression LBP is feature-based approach. effective & is a recognition an to facial approach have
LBP is an effective approach to have facial expression recognition & is a feature-based approach.
10,466
mixture Bayesian models and unsupervised learning analysis. exploratory data for applied widely are
Bayesian mixture models are widely applied for unsupervised learning and exploratory data analysis.
10,467
techniques explored been not Their have much. registration
Their registration techniques have not been explored much.
10,468
in making DEM-to-map are pyramid registration. Coarse-to-fine Methods like or DEM-to-image or common
Methods like Coarse-to-fine or pyramid making are common in DEM-to-image or DEM-to-map registration.
10,469
being error these methods lack evaluation. in apart time But and from intensive, complexity matrix
But these methods apart from being time and complexity intensive, lack in error matrix evaluation.
10,470
also been same the done. analysis Error for has
Error analysis for the same has also been done.
10,471
bind with can in a e.g. covalent way, Cysteine ZnS
Cysteine can bind with ZnS in a covalent way, e.g.
10,472
the forming disulfide S with by solid. in bond the
by forming the disulfide bond with S in the solid.
10,473
water is mobile. of first and layer Furthermore, disordered the
Furthermore, the first layer of water is disordered and mobile.
10,474
detection based optimization. circle a Differential on introduces This paper method Evolution (DE)
This paper introduces a circle detection method based on Differential Evolution (DE) optimization.
10,475
and shown remarkable has advantageous robustness. convergence also It properties
It has also shown advantageous convergence properties and remarkable robustness.
10,476
considered combinational to is optimization The a detection similar process problem.
The detection process is considered similar to a combinational optimization problem.
10,477
if image. in objective are actually circle the The determines some function present candidates
The objective function determines if some circle candidates are actually present in the image.
10,478
candidate Specifically, loci automatically identified adaptation by associations. are assessing genome-environment to
Specifically, candidate loci to adaptation are identified by automatically assessing genome-environment associations.
10,479
on the covalent cysteine atom the bond is sulfur The potential. Morse by with modeled
The covalent bond with the sulfur atom on cysteine is modeled by the Morse potential.
10,480
surface properties The the on depend water near sensitively force the field. of
The properties of water near the surface sensitively depend on the force field.
10,481
provide for information-aggregation a framework featuring reasoning modelling Multi-context powerful systems heterogeneous components. systems
Multi-context systems provide a powerful framework for modelling information-aggregation systems featuring heterogeneous reasoning components.
10,482
non-negligible execution cost. Their can, incur however,
Their execution can, however, incur non-negligible cost.
10,483
systems. of focus Here, on cost-complexity such we
Here, we focus on cost-complexity of such systems.
10,484
We cost-complexity MCSs. the of consistency formulate reasoning in and for notion problems
We formulate the notion of cost-complexity for consistency and reasoning problems in MCSs.
10,485
high-throughput depend RNA-seq protocols of sequencing Current on cDNA. short-read
Current RNA-seq protocols depend on high-throughput short-read sequencing of cDNA.
10,486
there segmenting is combined a for approach this, the In image.
In this, there is a combined approach for segmenting the image.
10,487
time. In image produce it segmented way computation this with better less
In this way it produce better segmented image with less computation time.
10,488
point. histogram class represents and threshold therefore the function a a pixel Each approximating Gaussian
Each Gaussian function approximating the histogram represents a pixel class and therefore a threshold point.
10,489
raised community currently. is problem the by complex management Crisis a scientific
Crisis management is a complex problem raised by the scientific community currently.
10,490
approach challenge. this paper The addresses this in we propose
The approach we propose in this paper addresses this challenge.
10,491
here. and approach The are provided experimentations general
The general approach and experimentations are provided here.
10,492
on give few a study. his We then notes
We then give a few notes on his study.
10,493
resolved. related body-check orientation issues such efficiently global Moreover, are to as
Moreover, global issues related to body-check such as orientation are efficiently resolved.
10,494
Many illustrate our from a pilot the efficiency of and framework. implementation effectiveness examples
Many examples from a pilot implementation illustrate the efficiency and effectiveness of our framework.
10,495
coordinate to has spatial been proposed coupling dynamics temporal across (CFC) neural Cross-frequency and scales.
Cross-frequency coupling (CFC) has been proposed to coordinate neural dynamics across spatial and temporal scales.
10,496
considerable Producing time. needed simulations large of quantity requires the computing
Producing the large quantity of simulations needed requires considerable computing time.
10,497
more where makes ABC applications to expensive. This simulation is scalable
This makes ABC more scalable to applications where simulation is expensive.
10,498
all-atom combined involves technique. method simulations with The sampling dynamics molecular umbrella the
The method involves all-atom molecular dynamics simulations combined with the umbrella sampling technique.
10,499