text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
provide of discussion by a the thorough Rodgers we study Here al. et conducted | Here we provide a thorough discussion of the study conducted by Rodgers et al. | 15,100 |
access to easy In offers it addition, parallel computations. | In addition, it offers easy access to parallel computations. | 15,101 |
additive down approach We quantitative genetic as an write phenotype to use map. the the | We use the quantitative genetic approach to write down the phenotype as an additive map. | 15,102 |
then component integral phenotype. of construct the We for models projection each | We then construct integral projection models for each component of the phenotype. | 15,103 |
per projection can be shorter generation or formulated on time Population models steps. on | Population projection models can be formulated on per generation or on shorter time steps. | 15,104 |
Yet, remains the large-scale networks. understanding control elusive of metabolic fluxes metabolic for efficient | Yet, understanding the efficient control of metabolic fluxes remains elusive for large-scale metabolic networks. | 15,105 |
find unicellular multicellular that control most extensive We less organisms than require organisms. | We find that most unicellular organisms require less extensive control than multicellular organisms. | 15,106 |
reactions in coli. strong transcriptional under identified Escherichia driver The regulation are | The identified driver reactions are under strong transcriptional regulation in Escherichia coli. | 15,107 |
we of detection. problem event paper efficient the video In this tackle | In this paper we tackle the problem of efficient video event detection. | 15,108 |
image microscopic in presented. counting a of cell this is An to application technique also | An application of this technique to cell counting in a microscopic image is also presented. | 15,109 |
exists. regular But this no not applicable grid is arbitrary to because approach surfaces | But this approach is not applicable to arbitrary surfaces because no regular grid exists. | 15,110 |
on paper nonstationary a will kernel approach data surfaces. for convolution describe This arbitrary | This paper will describe a nonstationary kernel convolution approach for data on arbitrary surfaces. | 15,111 |
algorithm we as a probabilistic linear Using factorisation filter. model, matrix the derive a recursive | Using the probabilistic model, we derive a matrix factorisation algorithm as a recursive linear filter. | 15,112 |
comparisons image an given. and restoration are Demonstrations on task | Demonstrations and comparisons on an image restoration task are given. | 15,113 |
for an we paper, RGB-D segmentation and propose unsupervised method indoor this analysis. In image | In this paper, we propose an unsupervised method for indoor RGB-D image segmentation and analysis. | 15,114 |
manner. opens color an perspectives in unsupervised Moreover, it to geometry fuse interesting and | Moreover, it opens interesting perspectives to fuse color and geometry in an unsupervised manner. | 15,115 |
changes (fractal dynamics) among long-range consecutive correlations the strides AC anti-correlations. into | AC changes the long-range correlations among consecutive strides (fractal dynamics) into anti-correlations. | 15,116 |
floor. of (VC) with marks on step the lengths alignment is cueing the Visual | Visual cueing (VC) is the alignment of step lengths with marks on the floor. | 15,117 |
of walking the on effects not The been have VC fluctuation structure investigated. of | The effects of VC on the fluctuation structure of walking have not been investigated. | 15,118 |
and conditions The no AC, VC. (NC), were cueing | The conditions were no cueing (NC), AC, and VC. | 15,119 |
stepping the projected stones speed. with synchronized treadmill In VC, were | In VC, projected stepping stones were synchronized with the treadmill speed. | 15,120 |
fluctuation structure. the assessed analysis correlation Detrended | Detrended fluctuation analysis assessed the correlation structure. | 15,121 |
also The was of coefficient (CV) assessed. variation | The coefficient of variation (CV) was also assessed. | 15,122 |
should induced gait by increased considered. However, be the VC variability | However, the increased gait variability induced by VC should be considered. | 15,123 |
for We the three wearable-camera testing collect of algorithm. proposed videos sets | We collect three sets of wearable-camera videos for testing the proposed algorithm. | 15,124 |
increasing interest vision from Proposals community. computer recent research technique is Object a receiving the | Object Proposals is a recent computer vision technique receiving increasing interest from the research community. | 15,125 |
Proposals field of techniques understanding in use text innovative. The is scene the Object | The use of Object Proposals techniques in the scene text understanding field is innovative. | 15,126 |
source publicly is available. The of made code method our | The source code of our method is made publicly available. | 15,127 |
most denoising, are edge-preserving non-linear. signal filters, The smoothing for efficient e.g., | The most efficient signal edge-preserving smoothing filters, e.g., for denoising, are non-linear. | 15,128 |
is filter dealt by freezing and restarting. careful non-linearity with The | The filter non-linearity is dealt with by careful freezing and restarting. | 15,129 |
segmentation an approach We for and recognition generative describe end-to-end the human of activities. | We describe an end-to-end generative approach for the segmentation and recognition of human activities. | 15,130 |
for data structured amount of models. sufficient when training available generative is | when sufficient amount of data is available for training structured generative models. | 15,131 |
called are tree These based networks. networks | These networks are called tree based networks. | 15,132 |
tree and are networks networks child-sibling based. all Reticulation-visible | Reticulation-visible networks and child-sibling networks are all tree based. | 15,133 |
the action calculus. In theories paper, in investigate this situation bounded we | In this paper, we investigate bounded action theories in the situation calculus. | 15,134 |
classes bounded action We theories. discuss various of | We discuss various classes of bounded action theories. | 15,135 |
form across quantification supports controlled Notably, situations. of variant a this | Notably, this variant supports a controlled form of quantification across situations. | 15,136 |
disadvantage Heterozygote potentially potent divergence. population a of driver is genetic | Heterozygote disadvantage is potentially a potent driver of population genetic divergence. | 15,137 |
components in task image central a multiple is computer into an Segmenting vision. | Segmenting an image into multiple components is a central task in computer vision. | 15,138 |
components plausible knowledge is practical prior scenarios, available. about many In | In many practical scenarios, prior knowledge about plausible components is available. | 15,139 |
address with the semantic of images task We tuples. annotating | We address the task of annotating images with semantic tuples. | 15,140 |
each argument. is type output We best that for the representation of also specific conclude | We also conclude that the best output representation is specific for each type of argument. | 15,141 |
to paper This a the cross-domain problem. introduces new solve method recognition | This paper introduces a new method to solve the cross-domain recognition problem. | 15,142 |
in source for we the labeled each of classes. samples construct subspaces given domain, Specifically, | Specifically, given labeled samples in source domain, we construct subspaces for each of the classes. | 15,143 |
the Comparison outperforms methods demonstrate datasets. results proposed both on comparison that method the | Comparison results demonstrate that the proposed method outperforms the comparison methods on both datasets. | 15,144 |
have devoted to pre-processing the Very efforts importance been the techniques. study of few | Very few efforts have been devoted to study the importance of the pre-processing techniques. | 15,145 |
representation's mechanism physiological this unknown. However, details of remain many | However, many details of this representation's physiological mechanism remain unknown. | 15,146 |
the networks become primary learning recognition. have for neural Deep technique object | Deep neural networks have become the primary learning technique for object recognition. | 15,147 |
makes the temporally which of non-trivial. deep application still are images, Videos, unlike networks coherent | Videos, unlike still images, are temporally coherent which makes the application of deep networks non-trivial. | 15,148 |
object we recognition videos. Here, short how investigate in can aid motion | Here, we investigate how motion can aid object recognition in short videos. | 15,149 |
Long Short-Term (LSTM) approach is Our on networks. based deep Memory | Our approach is based on Long Short-Term Memory (LSTM) deep networks. | 15,150 |
applications convolution. each we a gate previous LSTMs, of implement Unlike as | Unlike previous applications of LSTMs, we implement each gate as a convolution. | 15,151 |
computation size data analysis. sample Large brings the modern bottleneck for | Large sample size brings the computation bottleneck for modern data analysis. | 15,152 |
to is of this strategies handle Subsampling problem. one efficient | Subsampling is one of efficient strategies to handle this problem. | 15,153 |
the we non-asymptotic estimator. consistency provide and result, asymptotic subsample normality of the Besides | Besides the non-asymptotic result, we provide asymptotic consistency and normality of the subsample estimator. | 15,154 |
subsampling are proposed our real data to and Synthetic study empirically used strategies. | Synthetic and real data are used to empirically study our proposed subsampling strategies. | 15,155 |
representations RL. approaches to have attempted for efficient Recent automatically discover | Recent approaches have attempted to automatically discover efficient representations for RL. | 15,156 |
a algorithm for space. structure examine greedy over searching We the | We examine a greedy algorithm for searching over the structure space. | 15,157 |
problems which improves positive stable definite This yields performance. regression dual | This yields dual stable positive definite problems which improves regression performance. | 15,158 |
software, paintings. digital painting In organize layers | In digital painting software, layers organize paintings. | 15,159 |
final painting. transmitted, not explicitly or are with layers published represented, However, digital the | However, layers are not explicitly represented, transmitted, or published with the final digital painting. | 15,160 |
technique We digital decompose into to painting propose a layers. a | We propose a technique to decompose a digital painting into layers. | 15,161 |
is decomposition Our painting's based geometry. the on RGB-space | Our decomposition is based on the painting's RGB-space geometry. | 15,162 |
suggest vertices pixels of paint colors. RGB-space in hull convex The the of | The vertices of the convex hull of pixels in RGB-space suggest paint colors. | 15,163 |
resulting We of for utility re-editing. decompositions the the demonstrate | We demonstrate the utility of the resulting decompositions for re-editing. | 15,164 |
literature. compared work, with of number consider the classes previous this we relatively In larger | In this work, we consider relatively larger number of classes compared with the previous literature. | 15,165 |
our accuracy system and To the the knowledge, best the achieves of highest speed. | To the best of our knowledge, the system achieves the highest accuracy and speed. | 15,166 |
our is model trained repository. and on dataset available The | The trained model and dataset is available on our repository. | 15,167 |
and paper runtime. for we derive estimates this In DFS average BFS | In this paper we derive estimates for average BFS and DFS runtime. | 15,168 |
basis more an for methods. search They may of the analysis advanced form also | They may also form the basis for an analysis of more advanced search methods. | 15,169 |
The treats tree search. and paper both graph search | The paper treats both tree search and graph search. | 15,170 |
empirical that verification come Experimental shows reality. to our close approximations analytical | Experimental verification shows that our analytical approximations come close to empirical reality. | 15,171 |
by roles a challenge. remains functional played SNPs However, interpreting these the | However, interpreting the functional roles played by these SNPs remains a challenge. | 15,172 |
to use provides prototypes. an action the slow opportunity incremental feature analysis Applying | Applying incremental slow feature analysis provides an opportunity to use the action prototypes. | 15,173 |
path a essential rough The an of the in object signature is of paths. theory | The signature of a path is an essential object in the theory of rough paths. | 15,174 |
recover data can signature the The standard stream statistics, representation of e.g. | The signature representation of the data stream can recover standard statistics, e.g. | 15,175 |
segmentation task. is object an under-explored important Instance-level yet | Instance-level object segmentation is an important yet under-explored task. | 15,176 |
challenging. Nonetheless, proposals region accurate itself generating is quite | Nonetheless, generating accurate region proposals itself is quite challenging. | 15,177 |
ago a Fitness century by (IFT) proposed Theory half was Inclusive W.D. | Inclusive Fitness Theory (IFT) was proposed half a century ago by W.D. | 15,178 |
projections computation the Krylov eigendecomposition onto avoids suitable by costly subspaces. Polynomial of filtering | Polynomial filtering avoids costly computation of the eigendecomposition by projections onto suitable Krylov subspaces. | 15,179 |
be e.g., Polynomial bilateral can filters. the filters based, guided and on | Polynomial filters can be based, e.g., on the bilateral and guided filters. | 15,180 |
free. practical, is and method Our scalable model | Our method is practical, scalable and model free. | 15,181 |
E-T was The of instances hundreds tested in problems of particular several algorithm cases. and | The algorithm was tested in hundreds of instances of several E-T problems and particular cases. | 15,182 |
choose consist some to These pretreatment in based variables some and recoding on expertise. interactions | These pretreatment consist in recoding some variables and to choose some interactions based on expertise. | 15,183 |
the dimension. of use selection one in high of variable Lasso, robust We methods | We use Lasso, one of the robust methods of variable selection in high dimension. | 15,184 |
avoid two used. is levels To cross-validation fitting a over | To avoid over fitting a two levels cross-validation is used. | 15,185 |
our We and examples justify theory. by matrix perturbation the intuitive method | We justify our method by intuitive examples and the matrix perturbation theory. | 15,186 |
generally the demonstrate state neuron exists separatrix space that of the models. We in | We demonstrate that the separatrix generally exists in the state space of neuron models. | 15,187 |
accessible different evaluation settings: numbers. We discuss the and premise lemmas, ATPs, | We discuss the different evaluation settings: ATPs, accessible lemmas, and premise numbers. | 15,188 |
solving tools neural Convolutional becoming and visual object are standard for networks recognition tasks. | Convolutional neural networks are becoming standard tools for solving object recognition and visual tasks. | 15,189 |
based most of implementation of trail-and-error. these complex on and are the However, models design | However, most of the design and implementation of these complex models are based on trail-and-error. | 15,190 |
large with is kernels a classification networks considered. wide as general Specifically, with single-layer framework | Specifically, classification with wide single-layer networks with large kernels as a general framework is considered. | 15,191 |
learning itself. as is could Pool size as also be important procedure | Pool size is also could be as important as learning procedure itself. | 15,192 |
with Gaussian dimensional conditional include samplers This paper deals distributions. high that Gibbs | This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. | 15,193 |
i.e. proved is to converge, algorithm The | The algorithm is proved to converge, i.e. | 15,194 |
are to the according drawn distribution. target the distributed asymptotically samples | the drawn samples are asymptotically distributed according to the target distribution. | 15,195 |
It methods. in some methods non-Gaussian semi-blind/unsupervised finds in direct as applications as well | It finds direct applications in semi-blind/unsupervised methods as well as in some non-Gaussian methods. | 15,196 |
an on for unsupervised illustration focused the methods. paper super-resolution The estimation provides | The paper provides an illustration focused on the unsupervised estimation for super-resolution methods. | 15,197 |
are amplitude of important oscillation. two and properties Frequency | Frequency and amplitude are two important properties of oscillation. | 15,198 |
network produces different Studied modes oscillation. two of | Studied network produces two different modes of oscillation. | 15,199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.