text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
comparison a of sources Presented error. is of | Presented is a comparison of sources of error. | 7,300 |
the shown of error in converges limiting the that GCM (i). the It is case | It is shown that the error of the GCM converges in the limiting case (i). | 7,301 |
the the The of r-K equation results the logistic equation, model. solution in differential | The solution of the differential equation results in the logistic equation, the r-K model. | 7,302 |
experimental Cs profiles Cp- The well. the fitted model | The model fitted the experimental Cp- Cs profiles well. | 7,303 |
up possibilities to deconvolution. iterative investigate image for We speed algorithms non-blind | We investigate possibilities to speed up iterative algorithms for non-blind image deconvolution. | 7,304 |
faster than computation constellations Fourier the domain. some via allows In this | In some constellations this allows faster computation than via the Fourier domain. | 7,305 |
iterations can Second, be subsets progress, of restricted as computation to of convolutions pixels. | Second, as iterations progress, computation of convolutions can be restricted to subsets of pixels. | 7,306 |
unconstrained recognition However, the drastically. images, rates applied when to drop | However, when applied to unconstrained images, the recognition rates drop drastically. | 7,307 |
In image approach we a convex global for this hallucination. propose paper | In this paper we propose a global convex approach for image hallucination. | 7,308 |
al. on Tappen is based et Our work the paper of | Our work is based on the paper of Tappen et al. | 7,309 |
they image for use non-convex where model hallucination. a | where they use a non-convex model for image hallucination. | 7,310 |
with details high-frequency incorporate database to use high-resolution the We a output. images face to | We use a database with face images to incorporate high-frequency details to the high-resolution output. | 7,311 |
that convex using show results approach. by We state-of-the-art we can a achieve | We show that we can achieve state-of-the-art results by using a convex approach. | 7,312 |
this in In Making applications Decision of significance. Problems Modeling particular, have technique remarkable | In particular, applications of this Modeling technique in Decision Making Problems have remarkable significance. | 7,313 |
other Relation advantages are compared Soft paradigms of Fuzzy discussed. to The | The advantages of Fuzzy Soft Relation compared to other paradigms are discussed. | 7,314 |
Our important to several analysis conclusions. leaded | Our analysis leaded to several important conclusions. | 7,315 |
The curves and include clothoid, involute log-aesthetic (equiangular) the curves. logarithmic spiral, | The log-aesthetic curves include the logarithmic (equiangular) spiral, clothoid, and involute curves. | 7,316 |
surface filters formulation new on propose the discrete log-aesthetic Furthermore we surface . based | Furthermore we propose new discrete surface filters based on the log-aesthetic surface formulation . | 7,317 |
result conclude the We diagram a shape in of parameters. | We conclude the result in a shape diagram of parameters. | 7,318 |
to compute. intuitive more simplicity form this and makes The of efficient characterization | The simplicity of this form makes characterization more intuitive and efficient to compute. | 7,319 |
circles. and discussed curves The C-shape of separated are between two contact, transition S-shape | The transition curves discussed are S-shape and C-shape of contact, between two separated circles. | 7,320 |
curve one monotone of a curvature A decreasing spiral is of sign. increasing monotone or | A spiral is a curve of monotone increasing or monotone decreasing curvature of one sign. | 7,321 |
inflection spiral point or extreme. Thus, cannot curvature an a have | Thus, a spiral cannot have an inflection point or curvature extreme. | 7,322 |
Namely in is modulation. biochemical property remote ATP recycled hydrolyzation | Namely ATP hydrolyzation is recycled in remote biochemical property modulation. | 7,323 |
et proposed al. Generalized first by Cornu Ali Spiral The (GCS) was | The Generalized Cornu Spiral (GCS) was first proposed by Ali et al. | 7,324 |
a LCG The analysis GCS is the aesthetic generalized that claim supports of curve. indeed | The analysis of LCG supports the claim that GCS is indeed a generalized aesthetic curve. | 7,325 |
oscillatory Effective sharply pattern. times to conform irradiation a | Effective irradiation times conform to a sharply oscillatory pattern. | 7,326 |
and this extend aspect of latter to The presented confirm the here serve experiments phenomenon. | The experiments presented here serve to confirm and extend this latter aspect of the phenomenon. | 7,327 |
perform is chains the automatically algorithm and An hierarchical initialization presented clustering. to using Markov | An algorithm is presented to automatically perform the initialization using Markov chains and hierarchical clustering. | 7,328 |
values paper handwritten in records. temperature automatic recognition addresses weather the of This | This paper addresses the automatic recognition of handwritten temperature values in weather records. | 7,329 |
detection profiles. based localization table on cells using The is line projection of | The localization of table cells is based on line detection using projection profiles. | 7,330 |
line based stroke-preserving method removal a images gradient proposed. is on which is Further, | Further, a stroke-preserving line removal method which is based on gradient images is proposed. | 7,331 |
the resistance. of the introduction by been has drugs new Repeatedly, of evolution followed | Repeatedly, the introduction of new drugs has been followed by the evolution of resistance. | 7,332 |
distributions al. is et in Nakayama for applied general This originally idea Fisher-Bingham | This idea is originally applied for general Fisher-Bingham distributions in Nakayama et al. | 7,333 |
time. OR-gate turns XOR-gate into a over that an | an OR-gate that turns into a XOR-gate over time. | 7,334 |
local problems. could the and both This strategy solve maxima outlier the | This strategy could solve both the outlier and the local maxima problems. | 7,335 |
and change diversity? why does How mortality generate this | How and why does mortality change generate this diversity? | 7,336 |
deal to solvers propose extension this We an of with SAT CDCL-based fundamental problem. | We propose an extension of CDCL-based SAT solvers to deal with this fundamental problem. | 7,337 |
the edges ones detects This than conventional method. accurately the Sobel the obtained by technique | This technique detects the edges accurately than the ones obtained by the conventional Sobel method. | 7,338 |
proposed The merit of the the proposed of the substantiate technique. results method | The results of the proposed method substantiate the merit of the proposed technique. | 7,339 |
the consider model, binary integrate-and-fire We the process. the neuron leaky Hawkes model, and | We consider the binary neuron model, the leaky integrate-and-fire model, and the Hawkes process. | 7,340 |
closed covariance. form for Both the classes allow solutions | Both classes allow closed form solutions for the covariance. | 7,341 |
The framework results transfer unified between to enables models. us | The unified framework enables us to transfer results between models. | 7,342 |
applicable suitable averages. network approach and Our general is to population for structures | Our approach is applicable to general network structures and suitable for population averages. | 7,343 |
in-degree. exact and out-degree The fixed are for derived approximate architectures fixed network averages for | The derived averages are exact for fixed out-degree network architectures and approximate for fixed in-degree. | 7,344 |
analysis. role The plays critical $D$ number of our a condition in | The condition number of $D$ plays a critical role in our analysis. | 7,345 |
our consistent with results. theoretical are Numerical simulations | Numerical simulations are consistent with our theoretical results. | 7,346 |
measures, are distinguishing in on community types. other effective hand, OTU-based the less | OTU-based measures, on the other hand, are less effective in distinguishing community types. | 7,347 |
developed. model framework counterions in vibrations studied of are of with phenomenological conformational Z-DNA The | The conformational vibrations of Z-DNA with counterions are studied in framework of phenomenological model developed. | 7,348 |
The Z-DNA. results spectra the experimental Raman obtained describe well of | The obtained results describe well the experimental Raman spectra of Z-DNA. | 7,349 |
to generalize we this high-dimensional In of Bernoulli templates. learning their theory mixture paper, | In this paper, we generalize their theory to learning mixture of high-dimensional Bernoulli templates. | 7,350 |
We the theoretical by illustrate synthetic results real and examples. | We illustrate the theoretical results by synthetic and real examples. | 7,351 |
experiments Adaptation and Flower set. data We set Domain conduct data on Oxford | We conduct experiments on Domain Adaptation data set and Oxford Flower data set. | 7,352 |
The improve all proposed method from standard that cases. demonstrate descriptors results in our | The results demonstrate that our proposed method improve from standard descriptors in all cases. | 7,353 |
data simulations illustrate results our real a theoretical with We experiment. and | We illustrate our theoretical results with simulations and a real data experiment. | 7,354 |
is the proposed algorithm improvised An work Yoshimoto Harada. of on and based | An improvised algorithm is proposed based on the work of Yoshimoto and Harada. | 7,355 |
remains intense efforts Its decades. despite etiology research over enigmatic many | Its etiology remains enigmatic despite intense research efforts over many decades. | 7,356 |
competitive with a rim. to core Hypercellularity leads a contact-inhibited proliferating | Hypercellularity leads to a contact-inhibited core with a competitive proliferating rim. | 7,357 |
changing coexist, the whole. Several of combinations can the phenotypes of fitness | Several combinations of phenotypes can coexist, changing the fitness of the whole. | 7,358 |
exact applications, distance very the important. many of In geodesic computation graphics is | In many graphics applications, the computation of exact geodesic distance is very important. | 7,359 |
the number simple to windows. also of control a effective adopt yet total We strategy | We also adopt a simple yet effective strategy to control the total number of windows. | 7,360 |
the domain treasure. and pathologist's is a therapy personalized targeted Identifying for targets | Identifying targets for personalized targeted therapy is the pathologist's domain and a treasure. | 7,361 |
tests suggested content described. somatic report for is The pathology mutation | The suggested pathology report content for somatic mutation tests is described. | 7,362 |
is necessary Visuo-spatial analysis multi-level step analysis. for a | Visuo-spatial analysis is a necessary step for multi-level analysis. | 7,363 |
position seems such represent to to codes' cortex `grid accurately. multi-scale use stochastic periodic Indeed, | Indeed, cortex seems to use such stochastic multi-scale periodic `grid codes' to represent position accurately. | 7,364 |
also this are that for statistically hold Does not finding neurons independent? | Does this finding also hold for neurons that are not statistically independent? | 7,365 |
correlations the of mismatches grids neurons, increasing the noise For the fall between rapidly. two | For increasing mismatches between the grids of the two neurons, the noise correlations fall rapidly. | 7,366 |
on dictionary new enhance proposes based method paper image This a learning. | This paper proposes a new image enhance method based on dictionary learning. | 7,367 |
atoms. image adjusts by of the rarity proposed method the the Particularly, manipulating dictionary | Particularly, the proposed method adjusts the image by manipulating the rarity of dictionary atoms. | 7,368 |
Firstly, on coding sparse blocks. learn algorithms dictionary the through divided sub-image | Firstly, learn the dictionary through sparse coding algorithms on divided sub-image blocks. | 7,369 |
the rarity the sparse statistics coefficients. corresponding of atoms Secondly, of on dictionary compute | Secondly, compute the rarity of dictionary atoms on statistics of the corresponding sparse coefficients. | 7,370 |
the Thirdly, form according and specific application a new to rarity adjust dictionary. | Thirdly, adjust the rarity according to specific application and form a new dictionary. | 7,371 |
image sparse and dictionary the the coefficients. updated reconstruct Finally, using | Finally, reconstruct the image using the updated dictionary and sparse coefficients. | 7,372 |
The results experimental the proposed demonstrate of image enhance the method. effectiveness | The experimental results demonstrate the effectiveness of the proposed image enhance method. | 7,373 |
been article developed. this segmentation a color for In algorithm novel image has | In this article a novel algorithm for color image segmentation has been developed. | 7,374 |
formulate channels integrated again that, to color the After are new modified new image. a | After that, the new modified channels are integrated again to formulate a new color image. | 7,375 |
distortion. of suffers The kind resulted image from some | The resulted image suffers from some kind of distortion. | 7,376 |
This by very significant process eye. the ocular looks | This process looks very significant by the ocular eye. | 7,377 |
results were proposed variety test presented a support the Experimental images algorithm. on to of | Experimental results were presented on a variety of test images to support the proposed algorithm. | 7,378 |
into it EA. all easily turned a (EA), be Like Algorithms Pareto-based Evolutionary Multi-Objective can | Like all Evolutionary Algorithms (EA), it can easily be turned into a Pareto-based Multi-Objective EA. | 7,379 |
of also notion to extend the closure We component. rational Abox the | We also extend the notion of rational closure to the Abox component. | 7,380 |
computational evolution predict design networks to features of use processing ligand We categorization. | We use computational evolution to predict design features of networks processing ligand categorization. | 7,381 |
of a immune response The as is considered important case-study. early problem | The important problem of early immune response is considered as a case-study. | 7,382 |
be models substructures of recognition. immune Corresponding in identified current network can | Corresponding network substructures can be identified in current models of immune recognition. | 7,383 |
and biochemical between work deep immune Our a adaptation. recognition analogy draws | Our work draws a deep analogy between immune recognition and biochemical adaptation. | 7,384 |
profiling. than beyond and also This sentiment much classical customer analysis, goes further | This goes beyond classical sentiment analysis, and also much further than customer profiling. | 7,385 |
used statistical emulating models expensive process simulators. (GP) metamodels are computer commonly Gaussian for | Gaussian process (GP) models are commonly used statistical metamodels for emulating expensive computer simulators. | 7,386 |
a model by of This implements version modified the paper slightly et Ranjan proposed al. | This paper implements a slightly modified version of the model proposed by Ranjan et al. | 7,387 |
for used test a comparison popular with are functions R Several mlegp. package performance | Several test functions are used for performance comparison with a popular R package mlegp. | 7,388 |
a of segmentation based present images. a novel representation on hierarchical We algorithm | We present a novel segmentation algorithm based on a hierarchical representation of images. | 7,389 |
has three exploratory approach main This goals. | This exploratory approach has three main goals. | 7,390 |
the in Simple objects tree articulated decade. for models last prevails | Simple tree models for articulated objects prevails in the last decade. | 7,391 |
VOC challenge further images the findings. on Experiments support from our animal | Experiments on animal images from the VOC challenge further support our findings. | 7,392 |
impaired. structure above sequence However, recombination) hence difference threshold, is (and a | However, above a sequence difference threshold, structure (and hence recombination) is impaired. | 7,393 |
algorithm bandits. con-textual Exponentiated LINUCB, Gradient multi-armed for We an present | We present Exponentiated Gradient LINUCB, an algorithm for con-textual multi-armed bandits. | 7,394 |
of uses optimal to Exponentiated find LINUCB. algorithm Gradient the the exploration This | This algorithm uses Exponentiated Gradient to find the optimal exploration of the LINUCB. | 7,395 |
results demonstrate algorithms. experimental The that algorithm surveyed outperforms our | The experimental results demonstrate that our algorithm outperforms surveyed algorithms. | 7,396 |
surface example with use car splines aesthetics body of is of given. the The modelling | The example of car body surface modelling with the use of aesthetics splines is given. | 7,397 |
the for representations. of of three dots compare identification needed number average among We types | We compare the average number of dots needed for identification among three types of representations. | 7,398 |
will predicts the results similar. Our three from that hypothesis be representations the | Our hypothesis predicts that the results from the three representations will be similar. | 7,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.