text
stringlengths
27
153
label
stringlengths
27
153
id
int64
0
40k
possible it Furthermore detector irredundant to equivalent is each modification. for its construct and
Furthermore for each detector it is possible to construct its irredundant and equivalent modification.
1,700
lower possesses detector complexity computational and Modified preferable. is
Modified detector possesses lower computational complexity and is preferable.
1,701
between compression a plates. Nanoindentation parallel by as large is tip modeled
Nanoindentation by a large tip is modeled as compression between parallel plates.
1,702
process or background the individual textual pixels text classifies images. binarisation as Text in
Text binarisation process classifies individual pixels as text or background in the textual images.
1,703
to between recognition necessary OCR. is by Binarization localization gap and bridge the
Binarization is necessary to bridge the gap between localization and recognition by OCR.
1,704
images window method presents background. Sliding to with from binarise paper This text textual textured
This paper presents Sliding window method to binarise text from textual images with textured background.
1,705
iterative are by detected thresholding. Then Edges
Then Edges are detected by iterative thresholding.
1,706
population dynamics approximately the this evidence as the is ocean scale-invariant. interpret that We in
We interpret this as evidence that the population dynamics in the ocean is approximately scale-invariant.
1,707
model. population of dynamical construction use the a solution and this in We invariance size-structured
We use this invariance in the construction and solution of a size-structured dynamical population model.
1,708
results are that provide prone. fragments a of Our aggregation for basis wide genome search
Our results provide a basis for genome wide search of fragments that are aggregation prone.
1,709
the As we VOI selection problem. estimation study, a in measurement case examine
As a case study, we examine VOI estimation in the measurement selection problem.
1,710
Then image membership the net on pixel. the value of binarized is depending each
Then the image is binarized depending on the net membership value of each pixel.
1,711
mapping metadata versions We annotated content-based between for an show video. application of
We show an application for content-based metadata mapping between versions of annotated video.
1,712
detail. of players been strategies has two in dynamics two studied Evolutionary great with game
Evolutionary game dynamics of two players with two strategies has been studied in great detail.
1,713
one-shot we with Here, games players. address multiple
Here, we address one-shot games with multiple players.
1,714
dynamical games complexity interactions. that be pairwise a Multiplayer captured great cannot on show based
Multiplayer games show a great dynamical complexity that cannot be captured based on pairwise interactions.
1,715
hold specific any easily for game results and can applied Our for e.g. be cases,
Our results hold for any game and can easily be applied for specific cases, e.g.
1,716
stag or multiplayer public hunts. goods games
public goods games or multiplayer stag hunts.
1,717
were different samples free-flow data text users. and collected isolated from containing Handwritten
Handwritten data samples containing isolated and free-flow text were collected from different users.
1,718
user. handwritten recognizes and isolated language-set from free-flow such collected samples test the Each designated
Each such language-set recognizes isolated and free-flow handwritten test samples collected from the designated user.
1,719
Light integral is ITMS. an part of the Red Violation System Detection An (RLVDS) automated
An automated Red Light Violation Detection System (RLVDS) is an integral part of the ITMS.
1,720
recognition is on studied. influence The accidental blade also of equality
The influence of accidental blade equality on recognition is also studied.
1,721
Finally, the is that compared models. model GA efficiency the developed of of previously to
Finally, the efficiency of the GA model is compared to that of previously developed models.
1,722
How fitness population to does a evolve fast peak from another? one
How fast does a population evolve from one fitness peak to another?
1,723
be fixed order mutations can or The of random. either
The order of mutations can either be fixed or random.
1,724
weighted and using face canonical are mean vector Reduced fusion vector eigenface rule. together fused
Reduced eigenface vector and canonical face vector are fused together using weighted mean fusion rule.
1,725
consisting evaluated database with The multiview of has face been faces. system UMIST
The system has been evaluated with UMIST face database consisting of multiview faces.
1,726
different containing basic characters were Bangla isolated data and Handwritten users. digits samples from collected
Handwritten data samples containing isolated Bangla basic characters and digits were collected from different users.
1,727
users. language-set Bangla handwritten collected the from isolated such designated Each basic test samples recognizes
Each such language-set recognizes isolated basic Bangla handwritten test samples collected from the designated users.
1,728
fundamental integrals problem of Bayesian asymptotic evaluation is a likelihood in statistics. accurate The marginal
The accurate asymptotic evaluation of marginal likelihood integrals is a fundamental problem in Bayesian statistics.
1,729
are on singularities. of based resolution Our results
Our results are based on resolution of singularities.
1,730
Such models. models finite state include discrete
Such models include finite state discrete models.
1,731
A new Gaussian for in models model determination is methodology developed. decomposable graphical
A new methodology for model determination in decomposable graphical Gaussian models is developed.
1,732
to hyper-parameters Typically, likelihood fixed maximum are the their estimations.
Typically, the hyper-parameters are fixed to their maximum likelihood estimations.
1,733
scheme the datasets. simulated of real We on illustrate efficiency and this new
We illustrate the efficiency of this new scheme on simulated and real datasets.
1,734
multiple users. text isolated Handwritten collected samples and free-flow from were
Handwritten isolated and free-flow text samples were collected from multiple users.
1,735
samples of recognize the categories handwriting both pages. trained user-specific to Tesseract of document is
Tesseract is trained to recognize user-specific handwriting samples of both the categories of document pages.
1,736
eliminated At intensity the background on at based a first, variance. level is coarse
At first, the background is eliminated at a coarse level based on intensity variance.
1,737
distinct makes This each other. foreground from components the
This makes the foreground components distinct from each other.
1,738
and removed using components text characteristic graphics. Then various features of the non-text are
Then the non-text components are removed using various characteristic features of text and graphics.
1,739
further text the Finally, are skew regions and binarized corrected for processing.
Finally, the text regions are skew corrected and binarized for further processing.
1,740
the context, this maximin ones. the are and criteria two considered: dispersion usually In minimax
In this context, two dispersion criteria are usually considered: the minimax and the maximin ones.
1,741
the Moreover, thanks black-box is approximated design interpolation. typically function to kernel whatever is, the
Moreover, whatever the design is, the black-box function is typically approximated thanks to kernel interpolation.
1,742
algorithms simulated we Then, domain. maximin determine to in propose annealing bounded any designs connected
Then, we propose simulated annealing algorithms to determine maximin designs in any bounded connected domain.
1,743
of schemes. convergence the We prove the different
We prove the convergence of the different schemes.
1,744
paper. in Such introduced this is modification
Such modification is introduced in this paper.
1,745
This and study of of are a conclusions series experiments. through this other validated numerical
This and other conclusions of this study are validated through a series of numerical experiments.
1,746
be factor will results. the deciding for producing This
This will be the deciding factor for producing results.
1,747
noise. against segmentation efficient Medical robust segmentation demands an and image algorithm
Medical image segmentation demands an efficient and robust segmentation algorithm against noise.
1,748
spatial algorithm proposed clustering uses fuzzy calculate membership value. to information The
The proposed clustering algorithm uses fuzzy spatial information to calculate membership value.
1,749
is The proposed using image ISFCM input algorithm. clustered
The input image is clustered using proposed ISFCM algorithm.
1,750
and FCM the has A been comparative made between proposed study ISFCM. conventional
A comparative study has been made between the conventional FCM and proposed ISFCM.
1,751
found be to conventional approach is FCM. proposed The the outperforming
The proposed approach is found to be outperforming the conventional FCM.
1,752
Our current of models. understanding computational motion based number this is on of a detailed
Our current understanding of this motion is based on a number of detailed computational models.
1,753
we present to Here models. computational mechanisms in distinct identify and the two analyze seek
Here we seek to identify and analyze two distinct mechanisms present in the computational models.
1,754
transform; Descriptor; . recognition; words: Key Fourier signature verification Wavelet personal
Key words: signature recognition; Fourier Descriptor; Wavelet transform; personal verification .
1,755
of sequences However, (e.g. often are length as fixed
However, as sequences are often of fixed length (e.g.
1,756
segmentation vital processing. Image of part image a is
Image segmentation is a vital part of image processing.
1,757
images can The be medical segmented same manually.
The same medical images can be segmented manually.
1,758
Medical step is image for most an analysis essential consequent tasks. segmentation image
Medical image segmentation is an essential step for most consequent image analysis tasks.
1,759
Clustering algorithm. generalized approach standard This (FCM) version a CMeans of is Fuzzy
This approach is a generalized version of standard Fuzzy CMeans Clustering (FCM) algorithm.
1,760
The is the standard of technique FCM eliminated technique. modifying in conventional limitation the
The limitation of the conventional FCM technique is eliminated in modifying the standard technique.
1,761
is proposed The the ORL with and databases. IITK the evaluated algorithm face
The proposed algorithm is evaluated with the ORL and the IITK face databases.
1,762
present results We these empirical theoretical that then corroborate bounds.
We then present empirical results that corroborate these theoretical bounds.
1,763
and FIS reasoning. fuzzy logic model decision-making approximate a Each combining is
Each FIS is a decision-making model combining fuzzy logic and approximate reasoning.
1,764
logic function utilizes membership fuzzy of ANFIS of rules and (MF). adjustment identification The automatic
The ANFIS utilizes automatic identification of fuzzy logic rules and adjustment of membership function (MF).
1,765
evaluated FIS on comparisons. two are settings based
FIS settings are evaluated based on two comparisons.
1,766
between for The ANFIS FIS comparison model classifying second events. settings structured the is and
The second comparison is the model settings between FIS and ANFIS for classifying structured events.
1,767
some results spreading. us This to general about epidemic obtain allows
This allows us to obtain some general results about epidemic spreading.
1,768
cluster, an graph on each Then drawn. isomorphic is
Then on each cluster, an isomorphic graph is drawn.
1,769
temporally distributions. firing Leader/follower delay times stable positively form skewed
Leader/follower firing delay times form temporally stable positively skewed distributions.
1,770
with inhibitory variance. results usually Blocking in times delay reduced synapses shorter
Blocking inhibitory synapses usually results in shorter delay times with reduced variance.
1,771
robust higher cycle rates, At essential rhythms. becomes growth transcription-translation a circadian for generating
At higher growth rates, a transcription-translation cycle becomes essential for generating robust circadian rhythms.
1,772
the We constraints. propagation two AllDifferent of study for algorithms conjunction
We study propagation algorithms for the conjunction of two AllDifferent constraints.
1,773
finding matchings. of simultaneous investigate bipartite problem Therefore, the we
Therefore, we investigate the problem of finding simultaneous bipartite matchings.
1,774
finding is Unfortunately, such NP-hard general. in matchings
Unfortunately, finding such matchings is NP-hard in general.
1,775
that experiments significant benefits over can new existing propagator offer this Our show methods.
Our experiments show that this new propagator can offer significant benefits over existing methods.
1,776
the an define We concept of symmetry. internal
We define the concept of an internal symmetry.
1,777
within satisfaction This a of solution a constraint problem. a is symmety
This is a symmety within a solution of a constraint satisfaction problem.
1,778
detail discuss this more this in We in paper.
We discuss this in more detail in this paper.
1,779
region It and the means life from microscopic. between emerges macroscopic a that
It means that the life emerges from a region between macroscopic and microscopic.
1,780
of with evolutionary finding the the An complexity sum genome. the important rule is correlated
An important finding is the sum rule correlated with the evolutionary complexity of the genome.
1,781
its Applications Web-based tendering summarised in processes is also terms properties. of of
Applications of Web-based tendering processes is also summarised in terms of its properties.
1,782
implementation on in of prior details. processes approaches are in discussed tendering researches DSS Furthermore,
Furthermore, prior researches on implementation of DSS approaches in tendering processes are discussed in details.
1,783
arise processes outlined. both from and Web-based of tendering Current issues paper-based are
Current issues arise from both of paper-based and Web-based tendering processes are outlined.
1,784
end of paper. Finally, this is conclusion the included at
Finally, conclusion is included at the end of this paper.
1,785
shown. have cell-to-cell transfers been Recently, P-gp
Recently, cell-to-cell P-gp transfers have been shown.
1,786
of P-gp. transfer We functional confirmed cell-to-cell
We confirmed cell-to-cell transfer of functional P-gp.
1,787
imposes the prior The across image constraints patches. overlapping continuity
The image prior imposes continuity constraints across the overlapping patches.
1,788
an filter. cross error back-projection We bilateral approximate an apply with technique,
We apply an error back-projection technique, with an approximate cross bilateral filter.
1,789
results well both based run-time quality as for present We comparative measurements. image visual as
We present comparative results for both run-time as well as visual image quality based measurements.
1,790
signature region of for interest was pre-processing new presented. approach A
A new approach for signature region of interest pre-processing was presented.
1,791
this bio-secure A paper further stage based an contribution automated cropping is systems. in of
A further contribution of this paper is an automated cropping stage in bio-secure based systems.
1,792
can more These be generate self combined to styles. styles
These styles can be self combined to generate more styles.
1,793
the the motivates problem. for Genetic use This of Algorithms
This motivates the use of Genetic Algorithms for the problem.
1,794
order of prove to a In characters. pool of images this, we made
In order to prove this, we made a pool of images of characters.
1,795
wavelet techniques packet and has discrete image as compression. wavelet Recently popular for emerged transform
Recently discrete wavelet transform and wavelet packet has emerged as popular techniques for image compression.
1,796
major transform one the of compression. is The of components image wavelet processing
The wavelet transform is one of the major processing components of image compression.
1,797
which significant information Our based selects include threshold the sub-bands, algorithm entropy. on
Our algorithm selects the sub-bands, which include significant information based on threshold entropy.
1,798
results better provides RLE. encoding length than suggested The is technique run enhanced
The enhanced run length encoding technique is suggested provides better results than RLE.
1,799