text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
is to expression. standard differential High-throughput RNA method gene determine sequencing (RNA-seq) now the | High-throughput RNA sequencing (RNA-seq) is now the standard method to determine differential gene expression. | 13,700 |
differentially estimates read on variability. count depends of expressed crucially Identifying genes | Identifying differentially expressed genes crucially depends on estimates of read count variability. | 13,701 |
techniques. spectral Traditional with approximately, minimization methods for problem solve this instance | Traditional methods solve this minimization problem approximately, for instance with spectral techniques. | 13,702 |
for occluded Machines, algorithm our object classification. When shows compared performance superior Restricted Boltzmann to | When compared to Restricted Boltzmann Machines, our algorithm shows superior performance for occluded object classification. | 13,703 |
based is and method mathematical Gaussian on interest scale based The morphology. map space | The method is based on Gaussian scale space based interest map and mathematical morphology. | 13,704 |
It luminance efficiently exudates. sized variation and can suitable it is handle for varied | It can efficiently handle luminance variation and it is suitable for varied sized exudates. | 13,705 |
an action There performing. cues reveal what multiple a which person are image is in | There are multiple cues in an image which reveal what action a person is performing. | 13,706 |
an be road, the information. can of presence additional and joggers other trail) source of | road, trail) and the presence of other joggers can be an additional source of information. | 13,707 |
recognition. limited R*CNN that show action is we Last, not to | Last, we show that R*CNN is not limited to action recognition. | 13,708 |
such classification. particular, be R*CNN In used tasks can as fine-grained tackle to attribute also | In particular, R*CNN can also be used to tackle fine-grained tasks such as attribute classification. | 13,709 |
People of by on Berkeley this claim reporting performance the dataset. We Attributes state-of-the-art validate | We validate this claim by reporting state-of-the-art performance on the Berkeley Attributes of People dataset. | 13,710 |
control experiments acceptable process that Negative the specificity has and and sensitivity. positive screening indicate | Negative and positive control experiments indicate that the screening process has acceptable specificity and sensitivity. | 13,711 |
large present web an approach learning amounts data of CNNs. We utilize for to | We present an approach to utilize large amounts of web data for learning CNNs. | 13,712 |
learning, we Specifically by CNN present inspired a curriculum two-step approach for training. | Specifically inspired by curriculum learning, we present a two-step approach for CNN training. | 13,713 |
to images visual representation. First, train easy use an initial we | First, we use easy images to train an initial visual representation. | 13,714 |
with more offers search. search strategy, the reportedly its efficient for potential best-first SSS*, | SSS*, with its best-first search strategy, reportedly offers the potential for more efficient search. | 13,715 |
search. using In algorithm depth-first effect, formulate we a best-first | In effect, we formulate a best-first algorithm using depth-first search. | 13,716 |
SSS*. practice, less typically variants Alpha-Beta than In evaluate nodes | In practice, Alpha-Beta variants typically evaluate less nodes than SSS*. | 13,717 |
These have hierarchy. policies to form a | These policies have to form a hierarchy. | 13,718 |
method the proposed increases, the if state space of the ones. However, existing outperforms size | However, if the size of the state space increases, the proposed method outperforms existing ones. | 13,719 |
of known collagen repairs fibers. tissue fibrosis to is by of be Tissue result a | Tissue fibrosis is known to be a result of repairs of tissue by collagen fibers. | 13,720 |
"Misrepair". a of collagen manner A is with fibers repair | A repair with collagen fibers is a manner of "Misrepair". | 13,721 |
stiffness the organ. of results or of Fibrosis in progressive atrophy organ and an failure | Fibrosis results in stiffness or atrophy of an organ and progressive failure of the organ. | 13,722 |
hair-whitening of probably and hair-loss fibrosis. Senile are consequence dermal | Senile hair-loss and hair-whitening are probably consequence of dermal fibrosis. | 13,723 |
foot-and-mouth disease animal Phylogeography, South Key-words: America, trade. virus, | Key-words: Phylogeography, foot-and-mouth disease virus, South America, animal trade. | 13,724 |
are Finally, the by labels super-pixel initial contextual refined further smoothing. | Finally, the initial super-pixel labels are further refined by contextual smoothing. | 13,725 |
gene synthetic problem Bayesian the using address optimization. design of We | We address the problem of synthetic gene design using Bayesian optimization. | 13,726 |
deal propose We this to issue. three-step with a approach | We propose a three-step approach to deal with this issue. | 13,727 |
the we First, of to Gaussian the behavior cell. process model use a emulate | First, we use a Gaussian process model to emulate the behavior of the cell. | 13,728 |
edge-aware The filtering. image filter is guided a for technique | The guided filter is a technique for edge-aware image filtering. | 13,729 |
improve We filter. acceleration and this applications will hope current further this performance of popularize | We hope this acceleration will improve performance of current applications and further popularize this filter. | 13,730 |
be back-propagation can algorithm. gradients the efficiently pixel-wise computed using The | The pixel-wise gradients can be efficiently computed using the back-propagation algorithm. | 13,731 |
maps use image this the work, In we saliency segmentation. for computed | In this work, we use the computed saliency maps for image segmentation. | 13,732 |
assignment method. protein (LBS) of Computational ligand function is prediction a well-established binding sites | Computational prediction of ligand binding sites (LBS) is a well-established protein function assignment method. | 13,733 |
apply (Reyes, the specific LBS algorithm we we recently Here described detection V.M. | Here we apply the specific LBS detection algorithm we recently described (Reyes, V.M. | 13,734 |
of our believe LBS this level We confidence increases the criterion predictions. further | We believe this further criterion increases the confidence level of our LBS predictions. | 13,735 |
a learning local structured edges the structures exploit CNN of using We by shadow framework. | We exploit the local structures of shadow edges by using a structured CNN learning framework. | 13,736 |
huge In numbers with massive modern research, frequently of are encountered. observations scientific datasets | In modern scientific research, massive datasets with huge numbers of observations are frequently encountered. | 13,737 |
real both supported simulation examples. method of The promising data preference by and the is | The promising preference of the method is supported by both simulation and real data examples. | 13,738 |
include and changes two point DNA DNA types: changes. mutations chromosome | DNA changes include two types: point DNA mutations and chromosome changes. | 13,739 |
are injuries the Severe DNA DNA causes for mutations. | Severe DNA injuries are the causes for DNA mutations. | 13,740 |
source In DNA is cells, of of main the mutations. somatic Misrepair DNA | In somatic cells, Misrepair of DNA is the main source of DNA mutations. | 13,741 |
in that can develop the Tumors only tissues are regenerable. | Tumors can only develop in the tissues that are regenerable. | 13,742 |
two regenerations tumor-development. repeated the are for cell injuries preconditions cell Repeated and | Repeated cell injuries and repeated cell regenerations are the two preconditions for tumor-development. | 13,743 |
For is prevention, a living style cancer moderate flexible and advised. | For cancer prevention, a moderate and flexible living style is advised. | 13,744 |
in characterized the development of Atherosclerosis (APs) atherosclerotic a plaques disease is arterial by endothelium. | Atherosclerosis is a disease characterized by the development of atherosclerotic plaques (APs) in arterial endothelium. | 13,745 |
APs part an on on and wall distribution. size The inhomogeneous arterial are of in | The APs in part of an arterial wall are inhomogeneous on size and on distribution. | 13,746 |
of an repair injured of AP development a of result endothelium. general, is In | In general, development of an AP is a result of repair of injured endothelium. | 13,747 |
part endothelium damage-sensitivity (Misrepair) and have Altered the local reduced makes increased of repair-efficiency. remodeling | Altered remodeling (Misrepair) makes the local part of endothelium have increased damage-sensitivity and reduced repair-efficiency. | 13,748 |
injuries, and endothelium for of Misrepairs. lipid-infusion, increased will this have Thus, risk part | Thus, this part of endothelium will have increased risk for injuries, lipid-infusion, and Misrepairs. | 13,749 |
of development deposition of in and Focalized a lipids of plaque. focalized result accumulation Misrepairs | Focalized accumulation of Misrepairs and focalized deposition of lipids result in development of a plaque. | 13,750 |
self-accelerating. of AP a is endothelium-Misrepair, and circle between lipid-infusion By an viscous growing | By a viscous circle between lipid-infusion and endothelium-Misrepair, growing of an AP is self-accelerating. | 13,751 |
faster grow part APs than arterial wall, younger ones. Within an of older | Within part of an arterial wall, older APs grow faster than younger ones. | 13,752 |
factor an atherosclerosis. growing Therefore, the in self-accelerated of is AP fatal a | Therefore, the self-accelerated growing of an AP is a fatal factor in atherosclerosis. | 13,753 |
scale, manual global parameters, minimal user provides SICP and the using rotation translation intervention. | SICP provides the global scale, rotation and translation parameters, using minimal manual user intervention. | 13,754 |
a proposed. explores to In originally his Gibson, of affordances as this paper tribute theory | In a tribute to Gibson, this paper explores his theory of affordances as originally proposed. | 13,755 |
how specific about Representation can reason we problem. determines a | Representation determines how we can reason about a specific problem. | 13,756 |
more a us easily others. representation helps find Sometimes proof one than | Sometimes one representation helps us find a proof more easily than others. | 13,757 |
Most on one reasoning representation. automated within tools focus current reasoning | Most current automated reasoning tools focus on reasoning within one representation. | 13,758 |
alternating spectral paper unmixing a on based projection. algorithm fast Dykstra's presents This | This paper presents a fast spectral unmixing algorithm based on Dykstra's alternating projection. | 13,759 |
to thus sought obtained projection. The to is converge guaranteed sequence the | The sequence thus obtained is guaranteed to converge to the sought projection. | 13,760 |
small better subformulas when algorithms perform unsatisfiable are MaxSAT early. these found Usually, | Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. | 13,761 |
In we formula MaxSAT graph representation. propose to using paper, a resolution-based the partition this | In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. | 13,762 |
one The and is ends optimal found. the algorithm remains partition only solution when | The algorithm ends when only one partition remains and the optimal solution is found. | 13,763 |
between parts. constraints to Still, approach this agnostic high-level remains object | Still, this approach remains agnostic to high-level constraints between object parts. | 13,764 |
preemptive desirable are which in allow schedules, almost less always practice. algorithms for Existing evacuation | Existing algorithms almost always allow for preemptive evacuation schedules, which are less desirable in practice. | 13,765 |
this recognition In face we scale. paper, study at | In this paper, we study face recognition at scale. | 13,766 |
at and how problems, scale. We and consider both pose recognition evaluate identification verification affects | We consider both verification and identification problems, and evaluate how pose affects recognition at scale. | 13,767 |
plant different consider gradients altitude In we (i.e. particular, the at | In particular, we consider the plant at different altitude gradients (i.e. | 13,768 |
expensive. more training difficult layers makes However, and adding computationally | However, adding layers makes training more difficult and computationally expensive. | 13,769 |
simple thumb rule of We be these to where a determine branches added. should formulate | We formulate a simple rule of thumb to determine where these branches should be added. | 13,770 |
It beliefs. by to knowledge discover means new completion simple facilitates operations vector of | It facilitates knowledge completion by means of simple vector operations to discover new beliefs. | 13,771 |
Extensive experimental proposed improvements. show results the with outperforms significant that model the state-of-the-arts | Extensive experimental results show that the proposed model outperforms the state-of-the-arts with significant improvements. | 13,772 |
Decision (i.e. tuples study the and Diagrams relations (MDD) We Multi-valued between | We study the relations between Multi-valued Decision Diagrams (MDD) and tuples (i.e. | 13,773 |
the variables). of Cartesian elements of Product | elements of the Cartesian Product of variables). | 13,774 |
tuples an and algorithms in-place we from present some MDD. Then, adding for deleting | Then, we present some in-place algorithms for adding and deleting tuples from an MDD. | 13,775 |
Table show experiments competitive are with MDD Some constraints constraints. that | Some experiments show that MDD constraints are competitive with Table constraints. | 13,776 |
of or performed genes. differentially over- number the expressed Two under-predicting tools poorly; | Two tools performed poorly; over- or under-predicting the number of differentially expressed genes. | 13,777 |
approach and good shown results. evaluation performed Thorough yields the has that has been | Thorough evaluation has been performed and has shown that the approach yields good results. | 13,778 |
for We evaluated our several learning machine portfolio. techniques | We evaluated several machine learning techniques for our portfolio. | 13,779 |
good on also We results confirm domain. yields our that approach SAT | We also confirm that our approach yields good results on SAT domain. | 13,780 |
equally with PC PC-GES another effective. GES), is algorithm, (a of For combination strong-linearity, | For strong-linearity, another algorithm, PC-GES (a combination of PC with GES), is equally effective. | 13,781 |
to quick Moreover, training a the updating process is derived improve speed. dictionary further | Moreover, a quick dictionary updating process is derived to further improve the training speed. | 13,782 |
approach a proposals. argue We data-driven, object semantic ranking for for | We argue for a data-driven, semantic approach for ranking object proposals. | 13,783 |
nature of and degree Bernstein Lupa\c{s} $(p,q)$-B$\acute{e}$zier reduction for We degree functions. elevation the study | We study the nature of degree elevation and degree reduction for Lupa\c{s} $(p,q)$-B$\acute{e}$zier Bernstein functions. | 13,784 |
$(p,q)$-Bernstein Lupa\c{s} using are represented curves basis. Parametric | Parametric curves are represented using Lupa\c{s} $(p,q)$-Bernstein basis. | 13,785 |
curves. introduce de Lupa\c{s} for We type Casteljau affine algorithm B$\acute{e}$zier $(p,q)$-Bernstein | We introduce affine de Casteljau algorithm for Lupa\c{s} type $(p,q)$-Bernstein B$\acute{e}$zier curves. | 13,786 |
similar curves. properties The new have curves to $q$-B$\acute{e}$zier some | The new curves have some properties similar to $q$-B$\acute{e}$zier curves. | 13,787 |
are and measured of occur data disciplines. angles Circular in variety scientific in data a | Circular data are data measured in angles and occur in a variety of scientific disciplines. | 13,788 |
promise circular Bayesian of flexible to for methods analysis allow data. | Bayesian methods promise to allow for flexible analysis of circular data. | 13,789 |
these phases the of specialized involve structures. Some formation large-scale of | Some of these phases involve the formation of specialized large-scale structures. | 13,790 |
We then be independence perturbations. through describe evolution manipulated can various how of external the | We then describe how the evolution of independence can be manipulated through various external perturbations. | 13,791 |
UCB algorithm of modified applied application Mi-UCT the The to the algorithm trees. is | The Mi-UCT algorithm is the application of the modified UCB algorithm applied to trees. | 13,792 |
as Vector or using Finally the Machines(SVM). eye is classified Support open closed state | Finally the eye state is classified as open or closed using Support Vector Machines(SVM). | 13,793 |
illumination carried using variation is in (BHE). Histogram Bi Equalization out Compensation | Compensation in illumination variation is carried out using Bi Histogram Equalization (BHE). | 13,794 |
actual found to The under is be robust conditions. system driving | The system is found to be robust under actual driving conditions. | 13,795 |
release KOS of versions and both the However, to users. pose new publishers KOS challenges | However, the release of new KOS versions pose challenges to both KOS publishers and users. | 13,796 |
random are network neural views deep convolutional (ConvNet) These to train classifiers. used | These random views are used to train deep convolutional neural network (ConvNet) classifiers. | 13,797 |
proposed methods cases. markedly CADe performance Our all improve in | Our proposed methods improve CADe performance markedly in all cases. | 13,798 |
accuracies been in networks visual problems. many have of neural splendid Deep exhibiting pattern classification | Deep neural networks have been exhibiting splendid accuracies in many of visual pattern classification problems. | 13,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.