text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
quantification limits is limits Biomarker and/or subject often detection. of to of data | Biomarker data is often subject to limits of quantification and/or limits of detection. | 9,500 |
to left- corresponds this Statistically, or interval-censoring. | Statistically, this corresponds to left- or interval-censoring. | 9,501 |
in variable and high-dimensional is about setting. paper estimation This an unsupervised clustering selection, | This paper is about variable selection, clustering and estimation in an unsupervised high-dimensional setting. | 9,502 |
location and expression, rearrangements, gene formatting controls and genetic the genetic of repair. timing DNA | DNA formatting controls the timing and location of genetic rearrangements, gene expression, and genetic repair. | 9,503 |
is of the of these circuits. events control cellular precise under Each | Each of these events is under the control of precise cellular circuits. | 9,504 |
computer are variation representations of in pervasive appearance Linear vision. subspace | Linear subspace representations of appearance variation are pervasive in computer vision. | 9,505 |
barriers. the structural plausible diffusion organization Additionally, explore of we | Additionally, we explore the structural organization of plausible diffusion barriers. | 9,506 |
a stronger of form We show the result. above | We show a stronger form of the above result. | 9,507 |
The clever tricks of induction. proof employs | The proof employs clever tricks of induction. | 9,508 |
networks. gene/transcription used signaling simulate The is factor to dynamics asymmetric Hopfield model in | The asymmetric Hopfield model is used to simulate signaling dynamics in gene/transcription factor networks. | 9,509 |
into a direct gene of model states. allows pattern expression for attractor a The mapping | The model allows for a direct mapping of a gene expression pattern into attractor states. | 9,510 |
and subject. literature on the review paper a comprehensive this timely presents This of | This paper presents a comprehensive and timely review of the literature on this subject. | 9,511 |
for (DBNs) Bayesian observed networks processes with are a states. Dynamic partially stochastic model general | Dynamic Bayesian networks (DBNs) are a general model for stochastic processes with partially observed states. | 9,512 |
DBNs inferring (i.e. is state Belief the belief filtering of task in the | Belief filtering in DBNs is the task of inferring the belief state (i.e. | 9,513 |
observations. over and probability process based incomplete distribution the states) on noisy | the probability distribution over process states) based on incomplete and noisy observations. | 9,514 |
large with spaces. can complex processes state hard in This be problem a | This can be a hard problem in complex processes with large state spaces. | 9,515 |
constraint the In inference lifted this language. from we article, decouple | In this article, we decouple lifted inference from the constraint language. | 9,516 |
each to the assigning Scene of is object problem labeling an pixel. label | Scene labeling is the problem of assigning an object label to each pixel. | 9,517 |
the and It segmentation problems. image object recognition unifies | It unifies the image segmentation and object recognition problems. | 9,518 |
horse demonstrate outperforms state-of-the-art CHM that Stanford and on datasets. Weizmann background We | We demonstrate that CHM outperforms state-of-the-art on Stanford background and Weizmann horse datasets. | 9,519 |
to Major were needed play in Answering Watson IBM Question advances for technology Jeopardy! | Major advances in Question Answering technology were needed for IBM Watson to play Jeopardy! | 9,520 |
framework seen can general be as abstract Dung's for non-monotonic theory argumentation reasoning. a | Dung's abstract argumentation theory can be seen as a general framework for non-monotonic reasoning. | 9,521 |
maximal to an function of knowledge the which consistent inconsistent returns base. subsets | to the function which returns maximal consistent subsets of an inconsistent knowledge base. | 9,522 |
also are attack define relations of which members We new class. this | We also define new attack relations which are members of this class. | 9,523 |
problems costs) participating (or produce different gains multi-agent constraints agents. Many include for the that | Many multi-agent problems include constraints that produce different gains (or costs) for the participating agents. | 9,524 |
gains model. cannot naturally constrained represented the of by be Asymmetric agents standard DCOP | Asymmetric gains of constrained agents cannot be naturally represented by the standard DCOP model. | 9,525 |
present DCOPs general a proposes paper (ADCOPs). The framework for Asymmetric | The present paper proposes a general framework for Asymmetric DCOPs (ADCOPs). | 9,526 |
in. constraints for ADCOPs valuations they may agents different In that have are involved different | In ADCOPs different agents may have different valuations for constraints that they are involved in. | 9,527 |
present converge quality The to local high the paper proposed search solutions. in algorithms | The local search algorithms proposed in the present paper converge to high quality solutions. | 9,528 |
call highly the We effect this `arrival non-ergodic of the frequent'. | We call this highly non-ergodic effect the `arrival of the frequent'. | 9,529 |
near are: spectrum. channels light infrared spectrum visible The the and | The channels are: the visible light spectrum and near infrared spectrum. | 9,530 |
Nowadays very techniques are image and decompression compression much digital important. | Nowadays digital image compression and decompression techniques are very much important. | 9,531 |
objects Image locate to typically and segmentation etc. is (lines, boundaries used curves | Image segmentation is typically used to locate objects and boundaries (lines, curves etc. | 9,532 |
changed something is the analyze. is which segmentation After into to image more meaningful | After segmentation the image is changed into something which is more meaningful to analyze. | 9,533 |
an measures. in paper parameter-free consider compression-based Hence, we distance this alternative approach: | Hence, in this paper we consider an alternative parameter-free approach: compression-based distance measures. | 9,534 |
p-Sulu We problem. a the planning solve then which Planner, CCQSP develop can tractably | We then develop the p-Sulu Planner, which can tractably solve a CCQSP planning problem. | 9,535 |
bounded. is is of to the failure first probability capability ensures that The | The first capability is to ensures that the probability of failure is bounded. | 9,536 |
theory, applications. systematically this properties, two In and compare metrics we on paper, these | In this paper, we systematically compare these two metrics on theory, properties, and applications. | 9,537 |
train and spike and conducting in statistical inferences the mean space. variance) | mean and variance) and conducting statistical inferences in the spike train space. | 9,538 |
when possible. beneficial little is This is clustering particularly | This is particularly beneficial when little clustering is possible. | 9,539 |
source reference to There different algorithms for genome. alignment the sequence available are open | There are different open source algorithms available for sequence alignment to the reference genome. | 9,540 |
tests nearly their ago a introduction since controversial. been Nevertheless, significance have century | Nevertheless, since their introduction nearly a century ago significance tests have been controversial. | 9,541 |
criticisms NHST. numerous are raised against Many aware researchers the not of | Many researchers are not aware of the numerous criticisms raised against NHST. | 9,542 |
NHST is reason why is misunderstood. often a undoubtedly This major very | This is undoubtedly a major reason why NHST is very often misunderstood. | 9,543 |
We architecture. a in noise ratio (SNR) compressive signal the lensless imaging analyze (LCI) to | We analyze the signal to noise ratio (SNR) in a lensless compressive imaging (LCI) architecture. | 9,544 |
of images approach. immunofluorescence the this classification Experiments the of show usefulness on indirect | Experiments on the classification of indirect immunofluorescence images show the usefulness of this approach. | 9,545 |
is of This the the to simplify encoding constraints. then information CNF applied | This information is then applied to simplify the CNF encoding of the constraints. | 9,546 |
Cellular and common of parallel Automata computations. most models simple are (CA) | Cellular Automata (CA) are common and most simple models of parallel computations. | 9,547 |
image in applied processing. successfully can CA be | CA can be successfully applied in image processing. | 9,548 |
this detection with compared techniques. existing The performance some of edge approach is | The performance of this approach is compared with some existing edge detection techniques. | 9,549 |
prepared MATLAB. and in used in the All this paper algorithms results are | All the algorithms and results used in this paper are prepared in MATLAB. | 9,550 |
for with multiple surveys objectives. decision-making sequential This algorithms problems designed article | This article surveys algorithms designed for sequential decision-making problems with multiple objectives. | 9,551 |
on learning. methods survey for we taxonomy, planning Using multi-objective this the literature and | Using this taxonomy, we survey the literature on multi-objective methods for planning and learning. | 9,552 |
discuss key for and Finally, applications such future we of outline work. opportunities methods | Finally, we discuss key applications of such methods and outline opportunities for future work. | 9,553 |
number Here, of into target the is a patches. partitioned | Here, the target is partitioned into a number of patches. | 9,554 |
each the patches In occluded when dictionary. excluded are updating frame, | In each frame, occluded patches are excluded when updating the dictionary. | 9,555 |
proposed several results that shows Extensive state-of-the-art challenging on method trackers. the outperforms experimental sequences | Extensive experimental results on several challenging sequences shows that the proposed method outperforms state-of-the-art trackers. | 9,556 |
GAC-Schema performs also supports. better find that than We on full-length HaggisGAC | We also find that HaggisGAC performs better than GAC-Schema on full-length supports. | 9,557 |
are of All for propagating excellent constraints. disjunctions algorithms the proposed | All the proposed algorithms are excellent for propagating disjunctions of constraints. | 9,558 |
is parts. into split modelling The two | The modelling is split into two parts. | 9,559 |
and The vision level the relies computer on enable low real-time of footages analysis surveillance. | The analysis of the footages relies on low level computer vision and enable real-time surveillance. | 9,560 |
trimap corresponding original size, segmentation a to built. upsampled and is This the is | This segmentation is upsampled to the original size, and a corresponding trimap is built. | 9,561 |
binding. protein organized network The domain the is specific core in of skeleton | The core skeleton of the network is organized in protein specific domain binding. | 9,562 |
settings. Such mechanism life in common is regulatory quite real a | Such a regulatory mechanism is quite common in real life settings. | 9,563 |
a present Monte-Carlo co-clusters. approximation polynomial-time mining thus for lagged We fuzzy algorithm | We thus present a polynomial-time Monte-Carlo approximation algorithm for mining fuzzy lagged co-clusters. | 9,564 |
Moreover, overlapping missing algorithm and patterns. anti-correlations, values noise, the handles | Moreover, the algorithm handles noise, anti-correlations, missing values and overlapping patterns. | 9,565 |
real artificial algorithm The evaluated was extensively using datasets. and both | The algorithm was extensively evaluated using both artificial and real datasets. | 9,566 |
the in method However, identifying network. in the be effective can hubs pattern-matching | However, the pattern-matching method can be effective in identifying hubs in the network. | 9,567 |
analysis new statistical that simple Markdown technology fully-reproducible a R and creating is makes painless. | R Markdown is a new technology that makes creating fully-reproducible statistical analysis simple and painless. | 9,568 |
or increasing be can also multimodal. monotonically relationships Diversity-dispersal | Diversity-dispersal relationships can also be monotonically increasing or multimodal. | 9,569 |
that our experimental algorithms. outperforms The demonstrate surveyed results algorithm | The experimental results demonstrate that our algorithm outperforms surveyed algorithms. | 9,570 |
constructed cost series of bitwise The is through operations strings. binary a volume on | The cost volume is constructed through bitwise operations on a series of binary strings. | 9,571 |
in problems recognition. recognition Single-sample the challenging face one face is of most | Single-sample face recognition is one of the most challenging problems in face recognition. | 9,572 |
This the the is present research of work. objective | This is the objective of the present research work. | 9,573 |
compressed research work, Specifically work to proposal is document images. the run-length on this in | Specifically in this research work, the proposal is to work on run-length compressed document images. | 9,574 |
activate thoughts, (pgACC), also and Pain loss to and sad hurt linked regrets. pregenual ACC | Pain and loss activate also pregenual ACC (pgACC), linked to sad thoughts, hurt and regrets. | 9,575 |
(LHb) The stimulated by habenula outcome, lateral aversive and is pain, predicted loss. received discomfort, | The lateral habenula (LHb) is stimulated by predicted and received pain, discomfort, aversive outcome, loss. | 9,576 |
LHb. lateral pgACC, found and caudolateral DTI Using adjacent dACC, OFC projections I to AI, | Using DTI I found dACC, pgACC, AI, adjacent caudolateral and lateral OFC projections to LHb. | 9,577 |
likely lack vACC This for projections for confirmed of mOFC. LHb was and | This lack of LHb projections was confirmed for vACC and likely for mOFC. | 9,578 |
disease can model. control mixtures population how using dynamics investigate improve We a host | We investigate how host mixtures can improve disease control using a population dynamics model. | 9,579 |
mixing The ratios. severity be a minimized disease over of range can | The disease severity can be minimized over a range of mixing ratios. | 9,580 |
of that findings diseases efficiently may in designing These help host crops. control mixtures | These findings may help in designing host mixtures that efficiently control diseases of crops. | 9,581 |
to many describe the with then generalize mixtures We model host components. | We then generalize the model to describe host mixtures with many components. | 9,582 |
the specialization increases, becomes in the decrease larger. degree disease As severity of | As the degree of specialization increases, the decrease in disease severity becomes larger. | 9,583 |
in of change implementations algorithm both and ready-to-use random XPP include Matlab. We the time | We include ready-to-use implementations of the random time change algorithm in both XPP and Matlab. | 9,584 |
A central that of neural recording activities of issue the many in distinguishing is neurons. | A central issue in neural recording is that of distinguishing the activities of many neurons. | 9,585 |
We present the parallel efficiency analyses that speedup and prove of the implementation. the efficacy | We present the speedup and efficiency analyses that prove the efficacy of the parallel implementation. | 9,586 |
used parallel be framework. each can methods different step at our Noteworthy, of | Noteworthy, different methods can be used at each step of our parallel framework. | 9,587 |
An the methods. proposed study approach existing superiority of over extensive proves state-of-the-art the experimental | An extensive experimental study proves the superiority of the proposed approach over existing state-of-the-art methods. | 9,588 |
are index. multi-dimensional coupled a features inverted Basically, into complementary | Basically, complementary features are coupled into a multi-dimensional inverted index. | 9,589 |
of exploit we color Specifically, c-MI. fusion local the into feature | Specifically, we exploit the fusion of local color feature into c-MI. | 9,590 |
well Importantly, prior complementary show we is c-MI many that to techniques. | Importantly, we show that c-MI is well complementary to many prior techniques. | 9,591 |
for as new in and a entity biometrics emerging multi-modal verification. Palmprints are human identification | Palmprints are emerging as a new entity in multi-modal biometrics for human identification and verification. | 9,592 |
and evolution mutations fix. of are by The outcomes which occur determined | The outcomes of evolution are determined by which mutations occur and fix. | 9,593 |
specific samplers space. other can sample specific In of for designed parts words, be the | In other words, specific samplers can be designed for specific parts of the sample space. | 9,594 |
total speedup and experiments. decrease of in observed Significant variation is | Significant speedup and decrease of total variation is observed in experiments. | 9,595 |
techniques prior benefits using performance highlight the dataset. our over We this of algorithm | We highlight the performance benefits of our algorithm over prior techniques using this dataset. | 9,596 |
on applications. classification we focus binary Here, | Here, we focus on binary classification applications. | 9,597 |
dependence vestigate ways. We in structure samplers in- MCMC different using the several | We in- vestigate several MCMC samplers using the dependence structure in different ways. | 9,598 |
particle of densities in filtering with density kernel filter. deals the The paper estimates | The paper deals with kernel density estimates of filtering densities in the particle filter. | 9,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.