text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
between learning features discriminative for Extracted multiple interactions within are framework recognizing people. a utilized | Extracted multiple features are utilized within a discriminative learning framework for recognizing interactions between people. | 15,300 |
and by investigate focal injury seizures acquired induced in epileptogenesis the head to rat. | to investigate focal seizures and acquired epileptogenesis induced by head injury in the rat. | 15,301 |
genome. move can around that DNA are elements different sequences Transposable to positions in the | Transposable elements are DNA sequences that can move around to different positions in the genome. | 15,302 |
can an lead genome size. process, increase and cause During this mutations, to in they | During this process, they can cause mutations, and lead to an increase in genome size. | 15,303 |
Despite genomic have no transposable biological function. large fraction, a representing elements clear | Despite representing a large genomic fraction, transposable elements have no clear biological function. | 15,304 |
tested is seven videos proposed on and with state-of-the-art method The compared several methods. | The proposed method is tested on several videos and compared with seven state-of-the-art methods. | 15,305 |
further robustness and proposed method. of support have the the effectiveness to results provided Our | Our results have provided further support to the effectiveness and robustness of the proposed method. | 15,306 |
on possible. based proposed the are results real-time indicate techniques that implementations Our | Our results indicate that real-time implementations based on the proposed techniques are possible. | 15,307 |
b) an How likes look works? ontology how it and | b) How an ontology look likes and how it works? | 15,308 |
it ontologies existing is consider reusing to not? required if Verify c) or | c) Verify if it is required to consider reusing existing ontologies or not? | 15,309 |
developed? the c) What is the of be complexity ontology to | c) What is the complexity of the ontology to be developed? | 15,310 |
of What design ontology are the d) development? and principles | d) What are the principles of ontology design and development? | 15,311 |
above. key This answers the all paper questions | This paper answers all the key questions above. | 15,312 |
that framework. Here, we three our methods follow introduce | Here, we introduce three methods that follow our framework. | 15,313 |
arguments discuss explain theoretical implications. this to provide its practical result and We | We provide theoretical arguments to explain this result and discuss its practical implications. | 15,314 |
heatmaps performance. we the Finally, unsupervised network investigate use of of assessment for neural | Finally, we investigate the use of heatmaps for unsupervised assessment of neural network performance. | 15,315 |
main large-scale are the make Indexing approaches. To Estimation search and feasible, Subset Distance | To make large-scale search feasible, Distance Estimation and Subset Indexing are the main approaches. | 15,316 |
relative their not However, has Subset performance been Indexing. for studied | However, their relative performance has not been studied for Subset Indexing. | 15,317 |
binary better strategies. investigate or n-ary works We retrieval under coding different whether | We investigate whether binary or n-ary coding works better under different retrieval strategies. | 15,318 |
new dictionary approach this a learning. present kernels paper we incorporating into of In | In this paper we present a new approach of incorporating kernels into dictionary learning. | 15,319 |
automatically effective by an proposed method is detected training the Moreover, landmarks. disturbing | Moreover, an effective training method is proposed by disturbing the automatically detected landmarks. | 15,320 |
for rare arise, nest-structured in dynamics a evolutionary example, can population migration. with These | These evolutionary dynamics can arise, for example, in a nest-structured population with rare migration. | 15,321 |
strength any selection. hold Our for of results | Our results hold for any strength of selection. | 15,322 |
intensive of is human the today. connectome research object an The | The human connectome is the object of an intensive research today. | 15,323 |
the of discovering directions question of is One the the field main edges. | One main question of the field is discovering the directions of the edges. | 15,324 |
we $(v,u)$ from Then to edge $u$. $v$ direct this | Then we direct this $(v,u)$ edge from $v$ to $u$. | 15,325 |
Traditional characters. suffer character handwritten in Chinese similar for approaches recognition classifying | Traditional approaches for handwritten Chinese character recognition suffer in classifying similar characters. | 15,326 |
field, medical are to diagnosis used the of increasingly images facilitate In diseases. | In the medical field, images are increasingly used to facilitate diagnosis of diseases. | 15,327 |
have patches based this solve been methods problem. to Some proposed | Some patches based methods have been proposed to solve this problem. | 15,328 |
the for departure this question This provides chapter. point | This question provides the departure point for this chapter. | 15,329 |
is games a variations. family Poker many card that of includes | Poker is a family of card games that includes many variations. | 15,330 |
We use two to training therefore propose sources. independent | We therefore propose to use two independent training sources. | 15,331 |
many in found Mixture uses areas. have models | Mixture models have found uses in many areas. | 15,332 |
To list models. and latent unsupervised empirical trait a learning, few: class Bayes, | To list a few: unsupervised learning, empirical Bayes, latent class and trait models. | 15,333 |
considering carefully only scoring mechanism formulated cases visible. are partially is The faces where challenging | The scoring mechanism is carefully formulated considering challenging cases where faces are only partially visible. | 15,334 |
speed. of despite that the DCN, achieve show our We runtime can practical use network | We show that despite the use of DCN, our network can achieve practical runtime speed. | 15,335 |
LBP cost The computational the property and their very features texture low. discriminative possess is | The LBP features possess the texture discriminative property and their computational cost is very low. | 15,336 |
compared. curves the and are results K-fold ROC obtained and proposed For approach are | For the proposed approach K-fold and ROC curves are obtained and results are compared. | 15,337 |
these R package in are available on CRAN. implemented nonparametric Several of tests the spTest, | Several of these nonparametric tests are implemented in the R package spTest, available on CRAN. | 15,338 |
of Validation methods of importance. segmentation image critical is | Validation of image segmentation methods is of critical importance. | 15,339 |
is in image increasingly the as Probabilistic results. popular captures it segmentation uncertainty | Probabilistic image segmentation is increasingly popular as it captures uncertainty in the results. | 15,340 |
of segmentation robust measure These probabilistic accuracy. a accurate multi-region and provide | These provide a robust and accurate measure of multi-region probabilistic segmentation accuracy. | 15,341 |
fully an graph, and connected both incorporating image Attribute-Graph is global characteristics. An local undirected | An Attribute-Graph is an undirected fully connected graph, incorporating both local and global image characteristics. | 15,342 |
problem demonstrate ranking. of applying the effectiveness the by We of them to image Attribute-Graphs | We demonstrate the effectiveness of Attribute-Graphs by applying them to the problem of image ranking. | 15,343 |
demonstrate its examples. We simulations and through applicability | We demonstrate its applicability through simulations and examples. | 15,344 |
to learn proposed methods been descriptors. data-dependent binary have Various | Various methods have been proposed to learn data-dependent binary descriptors. | 15,345 |
properties multiple computed is the are Secondly, RMGD extracted. binary image from strings where | Secondly, the RMGD is computed from multiple image properties where binary strings are extracted. | 15,346 |
and Prior statistical, studied iterative, techniques. has problem using representation work this sparse algebraic, low-rank | Prior work has studied this problem using algebraic, iterative, statistical, low-rank and sparse representation techniques. | 15,347 |
understanding for a is fundamental Scene environmental today's classification task in perception robotics. | Scene classification is a fundamental perception task for environmental understanding in today's robotics. | 15,348 |
a with segmentation. implemented of is This regularization semantic | This is implemented with a regularization of semantic segmentation. | 15,349 |
to connect the perceive world. language and vision Humans | Humans connect language and vision to perceive the world. | 15,350 |
similar for to build a connection computers? How | How to build a similar connection for computers? | 15,351 |
Thus, other for vision is ISR helpful unclear is whether still tasks. it | Thus, it is still unclear whether ISR is helpful for other vision tasks. | 15,352 |
combines model of instead single multiple simultaneously individually. models framework ensemble a The ensemble using | The framework combines multiple ensemble models simultaneously instead of using a single ensemble model individually. | 15,353 |
benchmark challenging sequences. on proposed tracker We the image test | We test the proposed tracker on challenging benchmark image sequences. | 15,354 |
boost use performance. regression resampled partial set Furthermore, we to on a least squares training | Furthermore, we use partial least squares regression on a resampled training set to boost performance. | 15,355 |
complex algorithm solution robust tracking object in is A scenes. for video proposed an | A robust algorithm solution is proposed for tracking an object in complex video scenes. | 15,356 |
efficacy the Experimental of validate radish approach. publicly the results available using proposed dataset the | Experimental results using the publicly available radish dataset validate the efficacy of the proposed approach. | 15,357 |
of include images. accessory These large clothing numbers and | These include large numbers of clothing and accessory images. | 15,358 |
survey synchronization theory noisy oscillators. of We in collections the | We survey the theory synchronization in collections of noisy oscillators. | 15,359 |
synchronization hydrodynamic flagellar applied framework to interactions. This by is | This framework is applied to flagellar synchronization by hydrodynamic interactions. | 15,360 |
synchronization, break physical in for ways. We discuss flagellar different which symmetry different this mechanisms | We discuss different physical mechanisms for flagellar synchronization, which break this symmetry in different ways. | 15,361 |
diverse are abundant Chromatin remodeling machineries and eukaryotic in cells. | Chromatin remodeling machineries are abundant and diverse in eukaryotic cells. | 15,362 |
results us segmentation to benchmark enables on feature achieve state-of-the-art This datasets. | This feature enables us to achieve state-of-the-art segmentation results on benchmark datasets. | 15,363 |
chains if the These reactivated can considers algorithm necessary. extinct be | These extinct chains can be reactivated if the algorithm considers necessary. | 15,364 |
the scheme. benefits Numerical the simulations of shows novel | Numerical simulations shows the benefits of the novel scheme. | 15,365 |
in been in These full previous addressed not have generality work. | These have not been addressed in full generality in previous work. | 15,366 |
step in two images. or matching estimating from key the depth more Stereo is | Stereo matching is the key step in estimating depth from two or more images. | 15,367 |
have performance. achieved Recently, some methods non-local been which proposed, state-of-the-art matching tree-based stereo | Recently, some tree-based non-local stereo matching methods have been proposed, which achieved state-of-the-art performance. | 15,368 |
MST. our because of partially is the overcome extreme the This DTs greediness | This is partially because our DTs overcome the extreme greediness of the MST. | 15,369 |
the Extensive on our demonstrate of experimental and benchmark effectiveness efficiency datasets some results framework. | Extensive experimental results on some benchmark datasets demonstrate the effectiveness and efficiency of our framework. | 15,370 |
give we Theory. on Bayesian the In outline an paper Decision this | In this paper we give an outline on the Bayesian Decision Theory. | 15,371 |
ARS high rejection rates. from with sampling independent generates via samples target acceptance the | ARS generates independent samples from the target via rejection sampling with high acceptance rates. | 15,372 |
each sampling computational pdf updated. time demanding is becomes However, the it from proposal more | However, sampling from the proposal pdf becomes more computational demanding each time it is updated. | 15,373 |
faster CARS than For is of a number large generating samples, desired ARS. | For generating a large number of desired samples, CARS is faster than ARS. | 15,374 |
a such properties filter. univariate of generalise Many filters median to | Many properties of univariate median filters generalise to such a filter. | 15,375 |
the demonstrate Numerical results. are the that experiments approximation validity presented of | Numerical experiments are presented that demonstrate the validity of the approximation results. | 15,376 |
cells encode regulatory diverse surprisingly, to noise. Not buffer mechanisms | Not surprisingly, cells encode diverse regulatory mechanisms to buffer noise. | 15,377 |
feedforward the One such incoherent mechanism circuit. is | One such mechanism is the incoherent feedforward circuit. | 15,378 |
propose which the scalable stochastic gradient algorithm makes based method learning (w.r.t. a We | We propose a stochastic gradient based learning algorithm which makes the method scalable (w.r.t. | 15,379 |
nonlinear. the examples), of training while number being | the number of training examples), while being nonlinear. | 15,380 |
trackers years. Tracking-by-detection recent are the most approaches successful object some in of | Tracking-by-detection approaches are some of the most successful object trackers in recent years. | 15,381 |
solution. two algorithms Then, are proposed for the | Then, two algorithms are proposed for the solution. | 15,382 |
search local TSP-D is it a generated, been After has solution improved through operators. then | After a TSP-D solution has been generated, it is then improved through local search operators. | 15,383 |
unmixing. normal model (NCM) has compositional used been in The hyperspectral extensively | The normal compositional model (NCM) has been extensively used in hyperspectral unmixing. | 15,384 |
has their focused variability. previous However, of the and/or on of research estimation most endmembers | However, most of the previous research has focused on estimation of endmembers and/or their variability. | 15,385 |
NCM. work Also, information little employed has spatial in | Also, little work has employed spatial information in NCM. | 15,386 |
be run. to to easy implement turns and The to out resulting algorithm efficient | The resulting algorithm turns out to be easy to implement and efficient to run. | 15,387 |
compared and state-of-the-art synthetic SCM current real We with on images. algorithms | We compared SCM with current state-of-the-art algorithms on synthetic and real images. | 15,388 |
the that accurate and endmembers SCM abundances. main in results more show The provide can | The results show that SCM can in the main provide more accurate endmembers and abundances. | 15,389 |
a as endmember under uncertainty of prediction the Moreover, error can serve certain estimated conditions. | Moreover, the estimated uncertainty can serve as a prediction of endmember error under certain conditions. | 15,390 |
approach on dataset. evaluate our the We MNIST | We evaluate our approach on the MNIST dataset. | 15,391 |
several algorithms in immense possibilities of offer the cognitive Machine-learning applications. development | Machine-learning algorithms offer immense possibilities in the development of several cognitive applications. | 15,392 |
In this War. Square game: paper, we present a board | In this paper, we present a board game: Square War. | 15,393 |
to Chinese War similar Go. board definition classic Square game is game the of The | The game definition of Square War is similar to the classic Chinese board game Go. | 15,394 |
Then game mathematical Square problem of War. we propose the a | Then we propose a mathematical problem of the game Square War. | 15,395 |
ding fundamental in cue Motion for and analysis a human activity scene understan- is videos. | Motion is a fundamental cue for scene analysis and human activity understan- ding in videos. | 15,396 |
can only be approach Each scenarios. applied limited on | Each approach can only be applied on limited scenarios. | 15,397 |
Gibbs learning. Monte often Markov Carlo a used Bayesian (MCMC) is sampling Chain method in | Gibbs sampling is a Markov Chain Monte Carlo (MCMC) method often used in Bayesian learning. | 15,398 |
sequential We requirements. sampling, parallelism by asynchronous Gibbs achieves which study simply ignoring | We study asynchronous Gibbs sampling, which achieves parallelism by simply ignoring sequential requirements. | 15,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.