text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
only can edges filters. using reliably local in be detected images such Indeed, | Indeed, edges in such images can be reliably detected using only local filters. | 14,000 |
that Unfortunately, achieve this goal methods slow. existing are quite | Unfortunately, existing methods that achieve this goal are quite slow. | 14,001 |
context gained much this has years. issue in attention The of recent in "inconsistency" | The issue of "inconsistency" in this context has gained much attention in recent years. | 14,002 |
is justified some of the indices only However usage by heuristics. the | However the usage of the indices is justified only by some heuristics. | 14,003 |
is unclear still really It "measure". they what | It is still unclear what they really "measure". | 14,004 |
structural language C BNs. presented on free Graph_sampler inference fast a software We here for | We presented here Graph_sampler a fast free C language software for structural inference on BNs. | 14,005 |
much and the a new kernel jumping in faster Metropolis-Hastings proposed strategy We algorithm. | We proposed a new and much faster jumping kernel strategy in the Metropolis-Hastings algorithm. | 14,006 |
uses source C storage. very fast, compact, The low memory distributed code is disk and | The source C code distributed is very compact, fast, uses low memory and disk storage. | 14,007 |
Maximum reconstruction frequently-discussed is parsimony the tree in methods estimation. of one phylogenetic most | Maximum parsimony is one of the most frequently-discussed tree reconstruction methods in phylogenetic estimation. | 14,008 |
is from It maximum parsimony extend necessary like phylogenetic trees networks. to therefore to concepts | It is therefore necessary to extend concepts like maximum parsimony from phylogenetic trees to networks. | 14,009 |
parsimony In paper, concepts, this the analyze problem under i.e. big these so-called we two | In this paper, we analyze the so-called big parsimony problem under these two concepts, i.e. | 14,010 |
networks their investigate and properties. we parsimonious maximum analyze | we investigate maximum parsimonious networks and analyze their properties. | 14,011 |
on different likelihood of phylogenetic concepts parallels we investigate networks. to parsimony some Lastly, | Lastly, we investigate some parallels of parsimony to different likelihood concepts on phylogenetic networks. | 14,012 |
discussed. backside the coin, composition SIL Also the of the is | Also the backside of the coin, the SIL composition is discussed. | 14,013 |
change. experienced archaic new genomes, number expansion genomic in indicating This rapid transcript copy | This new transcript experienced copy number expansion in archaic genomes, indicating rapid genomic change. | 14,014 |
basal bodies. is of lipofuscin An cells, which age group a spot aggregated pathologically contain | An age spot is pathologically a group of aggregated basal cells, which contain lipofuscin bodies. | 14,015 |
of bodies a cell. of is aging sign of Accumulation a lipofuscin | Accumulation of lipofuscin bodies is a sign of aging of a cell. | 14,016 |
is a of of tissue spots. the age for basis development Aging | Aging of a tissue is the basis for development of age spots. | 14,017 |
cells. flat spot accumulation A of lipofuscin results from containing | A flat spot results from accumulation of lipofuscin containing cells. | 14,018 |
in the resulting spot in the this of three-dimension, "grows" way, In protruding spot. | In this way, the spot "grows" in three-dimension, resulting in protruding of the spot. | 14,019 |
ability better generalize to approach has without fine-tuning. Additionally, across datasets our | Additionally, our approach has better ability to generalize across datasets without fine-tuning. | 14,020 |
to is a Set Programming of Qsmodels environment. Answer gaming interactive novel application | Qsmodels is a novel application of Answer Set Programming to interactive gaming environment. | 14,021 |
phenomena. interpreting theory in novel aging theory accumulation a Misrepair is | Misrepair accumulation theory is a novel theory in interpreting aging phenomena. | 14,022 |
species our longevity, MA also on theory evolution. aging, and adaptation, understanding improves premature | MA theory improves also our understanding on longevity, premature aging, adaptation, and species evolution. | 14,023 |
organism complexity the is longevity in of structure. The hidden of its of an potential | The potential of longevity of an organism is hidden in the complexity of its structure. | 14,024 |
and Cartesian-based crown-based explored: Pyramids. Two Spatial Spatial configurations novel Pyramid are | Two novel Spatial Pyramid configurations are explored: Cartesian-based and crown-based Spatial Pyramids. | 14,025 |
propose architecture, pixel deep image SegNet, a wise semantic labelling. novel for We | We propose a novel deep architecture, SegNet, for semantic pixel wise image labelling. | 14,026 |
feature These map input methods layer dimensions. lack maps to to deep a mechanism | These methods lack a mechanism to map deep layer feature maps to input dimensions. | 14,027 |
hoc e.g. features, methods to to upsample resort ad They | They resort to ad hoc methods to upsample features, e.g. | 14,028 |
map SegNet to outputs problems to these encoder image pixel by overcomes learning labels. | SegNet overcomes these problems by learning to map encoder outputs to image pixel labels. | 14,029 |
fixed-size the a we and analysis of provide for age-abundance relationships growing comprehensive communities. Here | Here we provide a comprehensive analysis of the age-abundance relationships for fixed-size and growing communities. | 14,030 |
in factor and beta a morphogenesis, growth growth, cell (TGF$\beta$) differentiation. role central plays Transforming | Transforming growth factor beta (TGF$\beta$) plays a central role in morphogenesis, growth, and cell differentiation. | 14,031 |
simulation creativity. the particular is modelling computational challenge One in of AI and | One particular challenge in AI is the computational modelling and simulation of creativity. | 14,032 |
and creative the are key learning aspects process. Feedback experience from of | Feedback and learning from experience are key aspects of the creative process. | 14,033 |
we using investigate creative could model. in we how implement Here systems feedback a social | Here we investigate how we could implement feedback in creative systems using a social model. | 14,034 |
that Writers the argue the We creative setting of Workshop describes the process. anatomy | We argue that the Writers Workshop setting describes the anatomy of the creative process. | 14,035 |
by the We relevance to of AI. discussing aspects of this conclude model other broader | We conclude by discussing the broader relevance of this model to other aspects of AI. | 14,036 |
In propose detection. propagation novel label this based we a paper, for method saliency | In this paper, we propose a novel label propagation based method for saliency detection. | 14,037 |
Image as Problem w.r.t. of Problem Decomposition a the (MP) Multicut Formulations | Formulations of the Image Decomposition Problem as a Multicut Problem (MP) w.r.t. | 14,038 |
graph attention. superpixel a considerable received have | a superpixel graph have received considerable attention. | 14,039 |
w.r.t. In MP instances the of contrast, | In contrast, instances of the MP w.r.t. | 14,040 |
We (LMP). the MP terms of a generalization with long-range propose | We propose a generalization of the MP with long-range terms (LMP). | 14,041 |
Both the motion tackled. of recovery the is fields images the high-resolution them and relating | Both the recovery of the high-resolution images and the motion fields relating them is tackled. | 14,042 |
a and leads to non-smooth problem. large-dimensional, non-convex This | This leads to a large-dimensional, non-convex and non-smooth problem. | 14,043 |
algorithmic framework to latter. address the We propose an | We propose an algorithmic framework to address the latter. | 14,044 |
Our methods fast evaluation techniques non-differentiable/non-convex and gradient on modern relies for optimization approach problems. | Our approach relies on fast gradient evaluation methods and modern optimization techniques for non-differentiable/non-convex problems. | 14,045 |
environments. process Species essentially a populations is random evolution their interaction biological and of between | Species evolution is essentially a random process of interaction between biological populations and their environments. | 14,046 |
physical fluctuations. a to As evolution statistical parameters are models in result, some subject | As a result, some physical parameters in evolution models are subject to statistical fluctuations. | 14,047 |
implication discussed. threshold for of change randomization the the antiviral due to The is strategies | The implication of the threshold change due to the randomization for antiviral strategies is discussed. | 14,048 |
its from consider Finance customers Triprima should of the head with manager. the consent borrowing | Triprima Finance should consider borrowing from its customers with the consent of the head manager. | 14,049 |
the Decision-making Finance activities manually. process analysis carried by PT out Triprima at | Decision-making activities at PT Triprima Finance carried out by the analysis process manually. | 14,050 |
decisions to be facilitate the determine to expected is to taken. kaposko | is expected to facilitate kaposko to determine the decisions to be taken. | 14,051 |
of the et report, work revisit we this In al. Pilleboue | In this report, we revisit the work of Pilleboue et al. | 14,052 |
subalgebras. relations example of The provides such interval convex an distributive of subclass one well-known | The well-known subclass of convex interval relations provides one such an example of distributive subalgebras. | 14,053 |
proposed model Eigen stochastic The al. by Feng et | The stochastic Eigen model proposed by Feng et al. | 14,054 |
The underlying this phenomenon well examined. been of yet has cause not | The underlying cause of this phenomenon has not yet been well examined. | 14,055 |
derivation custom inversion implementation This the typically algorithms. requires design, and of sophisticated | This typically requires the custom design, derivation and implementation of sophisticated inversion algorithms. | 14,056 |
The availability rely on covariances. of calculations the the | The calculations rely on the availability of the covariances. | 14,057 |
and horizontal transfers, neofunctionalization). duplication subsequent gene gene | horizontal gene transfers, gene duplication and subsequent neofunctionalization). | 14,058 |
models. intrinsic require of Many building previous such world computations | Many such computations require previous building of intrinsic world models. | 14,059 |
different how tasks. networks may solve Here we neural show spiking these | Here we show how spiking neural networks may solve these different tasks. | 14,060 |
have or contain The connectivity. constrained a synaptic dendritic and nonlinearities networks | The networks contain dendritic or synaptic nonlinearities and have a constrained connectivity. | 14,061 |
for We outputs connections. such learning networks rules or with recurrent then combine | We then combine such networks with learning rules for outputs or recurrent connections. | 14,062 |
to process without ancillary practical information. a Moreover, images procedure allows autocalibration | Moreover, a practical autocalibration procedure allows to process images without ancillary information. | 14,063 |
efficiency computational data with method. assess the the and the Experiments real of accuracy | Experiments with real data assess the accuracy and the computational efficiency of the method. | 14,064 |
allow space occur exploration to only approaches the most of sequentially. parameter However, the proposed | However, most proposed approaches only allow the exploration of the parameter space to occur sequentially. | 14,065 |
explore. Often, simultaneously batches it desirable propose to is to of parameter values | Often, it is desirable to simultaneously propose batches of parameter values to explore. | 14,066 |
processing large available. when is facilities case This parallel the particularly are | This is particularly the case when large parallel processing facilities are available. | 14,067 |
of being physical facets or These could optimized. the process facilities computational be | These facilities could be computational or physical facets of the process being optimized. | 14,068 |
in ups experiments experimental samples to many be biological allow set processed. simultaneously several | in biological experiments many experimental set ups allow several samples to be simultaneously processed. | 14,069 |
in running time, more much alternatives. resulting with elaborate well, compares The algorithm | The resulting algorithm compares well, in running time, with much more elaborate alternatives. | 14,070 |
function is Lipschitz The a function. that interest, the assumes of continuous $f$, approach | The approach assumes that the function of interest, $f$, is a Lipschitz continuous function. | 14,071 |
both of Saccades fast and the the direction. simultaneous are eyes same in movement | Saccades are fast and simultaneous movement of both the eyes in the same direction. | 14,072 |
saccadic the of velocity duration. the peak is SR to ratio saccadic | SR is the ratio of peak saccadic velocity to the saccadic duration. | 14,073 |
method. spotting by query string paper In propose word a this segmentation-free we | In this paper we propose a segmentation-free query by string word spotting method. | 14,074 |
boost we re-ranking step performance. in Finally introduce retrieval to order a | Finally we introduce a re-ranking step in order to boost retrieval performance. | 14,075 |
Our four steps. algorithm consists basic of | Our algorithm consists of four basic steps. | 14,076 |
First, method generates objectness map the objectness via our hypotheses. | First, our method generates the objectness map via objectness hypotheses. | 14,077 |
show that method Our outperforms our approaches. experimental results state-of-the-art extensive | Our extensive experimental results show that our method outperforms state-of-the-art approaches. | 14,078 |
need set. For elements the systems, one in the address only many most-probable | For many systems, one need only address the most-probable elements in the set. | 14,079 |
the greatly fall is if most probabilities this threshold. problem below simplified of The | The problem is greatly simplified if most of the probabilities fall below this threshold. | 14,080 |
essential. low- that and transform events properly high-probability mixes of Finding represents probability a is | Finding a probability transform that properly represents mixes of low- and high-probability events is essential. | 14,081 |
to are the Four simplify operators defined derivations. help | Four operators are defined to help simplify the derivations. | 14,082 |
genres. composed are even of multiple videos concepts or Often, | Often, videos are composed of multiple concepts or even genres. | 14,083 |
etc. action, For nature, instance, sports, videos may news contain | For instance, news videos may contain sports, action, nature, etc. | 14,084 |
classification the corresponds Each a to visual space. word region in | Each visual word corresponds to a region in the classification space. | 14,085 |
Such correlations genetic dynamics. pointed should, famously strongly Maynard influence John Smith as evolutionary out, | Such genetic correlations should, as John Maynard Smith famously pointed out, strongly influence evolutionary dynamics. | 14,086 |
particular of particle convergence follows. discussion A the of filters | A discussion of the convergence of particular particle filters follows. | 14,087 |
interest increase detector of use image. Harris-Laplace the the to regions we identify To accuracy, | To increase the accuracy, we use Harris-Laplace detector to identify the interest regions of image. | 14,088 |
build Retrieval (RBIR). we Image the Then, Region-Based | Then, we build the Region-Based Image Retrieval (RBIR). | 14,089 |
signatures. image retrieval, images efficient binary the into we storage For encode and | For the efficient image storage and retrieval, we encode images into binary signatures. | 14,090 |
image is The its regions. of interest a binary from created signature | The binary signature of a image is created from its interest regions. | 14,091 |
images. evaluate we on models COREL's created Finally, the | Finally, we evaluate the created models on COREL's images. | 14,092 |
and identifying aiming of components. design We space revisit relating its visualizations the at | We revisit the design space of visualizations aiming at identifying and relating its components. | 14,093 |
learning accuracy attribute-guided We that this retrieval improvement. show key a is factor for | We show that this attribute-guided learning is a key factor for retrieval accuracy improvement. | 14,094 |
learning makes our dataset the is work feasible. network large-scale contribution a Another of which | Another contribution of our work is a large-scale dataset which makes the network learning feasible. | 14,095 |
retrieval of networks in performance different evaluate We the extensively configurations. | We extensively evaluate the retrieval performance of networks in different configurations. | 14,096 |
phylogenetic the process Most evolutionary models stationary and that reversible. assume is | Most phylogenetic models assume that the evolutionary process is stationary and reversible. | 14,097 |
the the differ of The perturbations. imposed structure models on degree in | The models differ in the degree of structure imposed on the perturbations. | 14,098 |
the Bayesian analysis chain framework Carlo Monte using performed in methods. Markov The is | The analysis is performed in the Bayesian framework using Markov chain Monte Carlo methods. | 14,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.