text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
and demonstrate improvements, empirical studies effectiveness. their provide several to analyze We | We analyze several improvements, and provide empirical studies to demonstrate their effectiveness. | 4,400 |
for that in explanation Our show results are networks. methods MRE approaches promising Bayesian empirical | Our empirical results show that MRE methods are promising approaches for explanation in Bayesian networks. | 4,401 |
Fluorescent Hybridization) color (Multiplex provides karyotyping. In-Situ M-FISH | M-FISH (Multiplex Fluorescent In-Situ Hybridization) provides color karyotyping. | 4,402 |
accuracy improved approach The when the provided to compared pixel-by-pixel approach. | The approach provided improved accuracy when compared to the pixel-by-pixel approach. | 4,403 |
based of on feature horizontal projection is text each profile done The the words. extraction | The feature extraction is done based on the horizontal projection profile of each text words. | 4,404 |
graphical First-order probabilistic models. of representational power first-order models combine logic with | First-order probabilistic models combine representational power of first-order logic with graphical models. | 4,405 |
first-order models. for probabilistic effort lifted algorithms inference an ongoing is design There to | There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. | 4,406 |
importance lifted of processing empirical tests inference. in confirm Our the constraint | Our empirical tests confirm the importance of constraint processing in lifted inference. | 4,407 |
This study is first inference. and constraint empirical processing the in of lifted theoretical | This is the first theoretical and empirical study of constraint processing in lifted inference. | 4,408 |
use We as motivating application. forestry the planning | We use forestry planning as the motivating application. | 4,409 |
problems a reinforcement LSST using policy as solution and define present problems gradients. learning We | We define LSST problems as reinforcement learning problems and present a solution using policy gradients. | 4,410 |
different Protein function changes between conformations. involves often | Protein function often involves changes between different conformations. | 4,411 |
predominantly occurs the prior conformational unbinding. to change | the conformational change occurs predominantly prior to unbinding. | 4,412 |
is The contrast, in i.e. conformational during change catalytic the step, an induced change, | The conformational change during the catalytic step, in contrast, is an induced change, i.e. | 4,413 |
change the after occurs chemical reaction. the | the change occurs after the chemical reaction. | 4,414 |
environments plans optimal highly dynamic Generating challenging. is in | Generating optimal plans in highly dynamic environments is challenging. | 4,415 |
This to globally distribution, variational can efficiently approach a queried. consistent be which leads | This variational approach leads to a globally consistent distribution, which can be efficiently queried. | 4,416 |
bases. measure paper on conditional develops inconsistency an probabilistic knowledge This | This paper develops an inconsistency measure on conditional probabilistic knowledge bases. | 4,417 |
present and We on examples formal and usefulness immediate its some several application illustrate results. | We illustrate its usefulness and immediate application on several examples and present some formal results. | 4,418 |
to are graph-theoretic algorithms the concept of Our bisimulation. closely related | Our algorithms are closely related to the graph-theoretic concept of bisimulation. | 4,419 |
cannot true keep operations such classical sets. set-theoretic for soft laws all Unfortunately, | Unfortunately, such operations cannot keep all classical set-theoretic laws true for soft sets. | 4,420 |
pattern Attribute an data as step important preprocessing recognition is reduction for and mining. viewed | Attribute reduction is viewed as an important preprocessing step for pattern recognition and data mining. | 4,421 |
Most rough are researches attribute of focused on reduction using sets. by | Most of researches are focused on attribute reduction by using rough sets. | 4,422 |
sets with reduction C.C. paper the rough in attribute [E. discussed covering | discussed attribute reduction with covering rough sets in the paper [E. C.C. | 4,423 |
difficult. specification of aMarkov can decision The process (MDP) be | The specification of aMarkov decision process (MDP) can be difficult. | 4,424 |
an determining relationships. evolutionary in events role important Reticulate play | Reticulate events play an important role in determining evolutionary relationships. | 4,425 |
work publicly are three are on available. extensions theoretical of and previous based All methods | All three methods are based on extensions of previous theoretical work and are publicly available. | 4,426 |
to apply real We our data. methods also | We also apply our methods to real data. | 4,427 |
for is model a example, clustering. representative For model mixture hierarchical a | For example, a mixture model is a representative hierarchical model for clustering. | 4,428 |
the analysis statistical matrix is applicable. based on inverse Conventional not Fisher | Conventional statistical analysis based on the inverse Fisher matrix is not applicable. | 4,429 |
estimation to paper latent-variable its performance. The applies this and determines present analysis theoretical | The present paper applies this analysis to latent-variable estimation and determines its theoretical performance. | 4,430 |
Our the distribution. convergence of results the clarify behavior posterior of | Our results clarify behavior of the convergence of the posterior distribution. | 4,431 |
Metropolis-Hastings computationally a task. describes efficient accomplishing Recent for work method this | Recent work describes a computationally efficient Metropolis-Hastings method for accomplishing this task. | 4,432 |
constraints. incorporate how topological show to we Additionally, | Additionally, we show how to incorporate topological constraints. | 4,433 |
value analyses propagation and unify policy approximate provide We error for iteration. those that | We provide error propagation analyses that unify those for approximate policy and value iteration. | 4,434 |
in valued. be real of may However, individuals reputations situations, multiple | However, in real situations, reputations of individuals may be multiple valued. | 4,435 |
present by analyzing we study, gaps the fill In both model. a trinary reputation | In the present study, we fill both gaps by analyzing a trinary reputation model. | 4,436 |
to be problem known The mentioned APX-hard. is | The mentioned problem is known to be APX-hard. | 4,437 |
engineered Forward and reverse compatible. modules fully are | Forward and reverse engineered modules are fully compatible. | 4,438 |
also discussed. to gray images extension The scale are n-dimensional theoretical of GLCM | The theoretical extension of GLCM to n-dimensional gray scale images are also discussed. | 4,439 |
trace features to when Haralick indicate results CBIR. outperform The applied that features | The results indicate that trace features outperform Haralick features when applied to CBIR. | 4,440 |
known computer widely and well vision. graph used in is Spectral theory | Spectral graph theory is well known and widely used in computer vision. | 4,441 |
most misidentified. are the features are If extracted of the cases used, all | If all the extracted features are used, most of the cases are misidentified. | 4,442 |
with {\pi} Fuzzy-Rough In is feature paper, this proposed. function selection membership | In this paper, Fuzzy-Rough feature selection with {\pi} membership function is proposed. | 4,443 |
experimental improves method the the analysis mammograms shows proposed that accuracy. The classification | The experimental analysis shows that the proposed method improves the mammograms classification accuracy. | 4,444 |
the remove The show method mixed to the is noise. simulation results effective that | The simulation results show that the method is effective to remove the mixed noise. | 4,445 |
abacavir remains induces pathologic by However, unclear. which T response cell the mechanism this | However, the mechanism by which abacavir induces this pathologic T cell response remains unclear. | 4,446 |
for results provide To velocity substantiate real datasets. and we synthetic method, our field | To substantiate our method, we provide results for synthetic and real velocity field datasets. | 4,447 |
we at response antigen. saturated levels this allow particular, become high of In to | In particular, we allow this response to become saturated at high levels of antigen. | 4,448 |
and Sciences, of India, Delhi Hyderabad. Hills, Technology Vignan of Institute Vignan New at | of India, New Delhi at Vignan Institute of Technology and Sciences, Vignan Hills, Hyderabad. | 4,449 |
level equivalences equality capture of Rough at equalities. a than higher rough sets | Rough equivalences capture equality of sets at a higher level than rough equalities. | 4,450 |
leveled and studied. were the fact properties approximate of equalities introduced concepts In were | In fact the concepts of leveled approximate equalities were introduced and properties were studied. | 4,451 |
on alternating direction the The (ADM). is for solving based TILT existing algorithm method | The existing algorithm for solving TILT is based on the alternating direction method (ADM). | 4,452 |
times five could be It least faster method. previous the at than | It could be at least five times faster than the previous method. | 4,453 |
of understanding we extend Secondly, the histograms. local theoretical the | Secondly, we extend the theoretical understanding of the local histograms. | 4,454 |
preferred asymmetric is choice. our GPV is Also, an PW and measure, | Also, GPV is an asymmetric measure, and PW is our preferred choice. | 4,455 |
problem addresses This approximate in the graphical general models. MAP-MRF inference of paper | This paper addresses the problem of approximate MAP-MRF inference in general graphical models. | 4,456 |
also how show deal to efficient factors nested an with in We way. | We also show how to deal with nested factors in an efficient way. | 4,457 |
The independent based m online estimator simulation. from is Monte on an Carlo samples | The estimator is based on m samples from an independent online Monte Carlo simulation. | 4,458 |
applications terms computed. interest be correction cannot of the In many | In many applications of interest the correction terms cannot be computed. | 4,459 |
versions algorithms. of approximate We the consider | We consider approximate versions of the algorithms. | 4,460 |
learning based classification. note are representative presents for (DL) which This dictionary on some methods | This note presents some representative methods which are based on dictionary learning (DL) for classification. | 4,461 |
roughly divide two into some them methods, representative can listing By i.e. we categories, | By listing some representative methods, we can roughly divide them into two categories, i.e. | 4,462 |
this expect as future we extensions From can them taxonomy, of some researches. | From this taxonomy, we can expect some extensions of them as future researches. | 4,463 |
based proposes that segmentation images. can automatically method Algorithm Genetic segment gray-scale a This paper | This paper proposes a Genetic Algorithm based segmentation method that can automatically segment gray-scale images. | 4,464 |
generates image. results segmented shown quality algorithm that Experimental the good | Experimental results shown that the algorithm generates good quality segmented image. | 4,465 |
neighbor K (KNN) as classifier. nearest a used | K nearest neighbor (KNN) used as a classifier. | 4,466 |
development models. case-cohort data, has For less done been much with AFT | For case-cohort data, much less development has been done with AFT models. | 4,467 |
is one of fundamental recognition. extraction character of problems the Feature | Feature extraction is one of the fundamental problems of character recognition. | 4,468 |
evidence that is due We integration. stimulus to this provide improvement | We provide evidence that this improvement is due to stimulus integration. | 4,469 |
their of function as latency Rats increase trial response modestly a difficulty. | Rats increase their response latency modestly as a function of trial difficulty. | 4,470 |
also ABC pharmacological aspects targeting remain transporter Several of unclear. | Several aspects of pharmacological ABC transporter targeting also remain unclear. | 4,471 |
in similarity been to data. have the approaches Several sequences proposed measure between trajectory | Several approaches have been proposed to measure the similarity between sequences in trajectory data. | 4,472 |
wireless not of appropriate networks. in characteristics mobility are to However, spatiotemporal patterns they | However, they are not appropriate to characteristics of spatiotemporal mobility patterns in wireless networks. | 4,473 |
framework our of follows. as for is phases two composed The measure constructing | The framework for constructing our measure is composed of two phases as follows. | 4,474 |
The proved in mathematics. truth similarity and of the measures partial total are | The truth of the partial and total similarity measures are proved in mathematics. | 4,475 |
Models incorporation often these of interactions. lack to assess explicit interspecific extinction risk | Models to assess extinction risk often lack explicit incorporation of these interspecific interactions. | 4,476 |
(e.g. parameters effects We the investigate foraging of the | We investigate the effects of the foraging parameters (e.g. | 4,477 |
and time) to rate handling mean the extinction. time attack on | attack rate and handling time) on the mean time to extinction. | 4,478 |
query. link the of provided The the context is by main | The main link is provided by the context of the query. | 4,479 |
this information method With effectively. works minimal | With minimal information this method works effectively. | 4,480 |
the hospital. departments Scheduling problem can for multiple solved in be | Scheduling problem can be solved for multiple departments in the hospital. | 4,481 |
module wiki-like to minireview. extended Each contains and be documentation metadata for can a purposes | Each module contains metadata for documentation purposes and can be extended to a wiki-like minireview. | 4,482 |
manage can module. of each The database multiple versions | The database can manage multiple versions of each module. | 4,483 |
user e.g. according can defined to recombined (semi-) be automatically Modules scenarios | Modules can be (semi-) automatically recombined according to user defined scenarios e.g. | 4,484 |
patterns expression or given disease. gene under cell certain physiological types, states of conditions, in | gene expression patterns in given cell types, under certain physiological conditions, or states of disease. | 4,485 |
one recognition. is It most face the in successful techniques of | It is one of the most successful techniques in face recognition. | 4,486 |
high database. big size drawback it has But of computational especially for | But it has drawback of high computational especially for big size database. | 4,487 |
the eigenvectors authors participated the decreases computational time. The which consequently minimize | The authors minimize the participated eigenvectors which consequently decreases the computational time. | 4,488 |
used DET illustrate Curves are the to experimental results. | DET Curves are used to illustrate the experimental results. | 4,489 |
of muscles not. ions whether divalent calcium contract or determines concentration example, the For | For example, the concentration of divalent calcium ions determines whether muscles contract or not. | 4,490 |
The Concentrations Important Control Life Way Control Channels Important To Ion Voltages To Computers. Computers | Ion Channels Control Concentrations Important To Life The Way Computers Control Voltages Important To Computers. | 4,491 |
and atoms Chemistry is as react. configurations their electrons molecules changing about | Chemistry is about electrons changing their configurations as atoms and molecules react. | 4,492 |
ideal in studies infinitely solutions. Chemistry dilute if as reactions occurred they | Chemistry studies reactions as if they occurred in ideal infinitely dilute solutions. | 4,493 |
But solutions. nonideal in most occur reactions | But most reactions occur in nonideal solutions. | 4,494 |
this has developed interacting of deal sort. with to recently been systems Mathematics | Mathematics has recently been developed to deal with interacting systems of this sort. | 4,495 |
The spawned has liquid fluids crystals. the of complex of theory variational theory | The variational theory of complex fluids has spawned the theory of liquid crystals. | 4,496 |
solutions be ionic In as should complex fluids. my view, viewed | In my view, ionic solutions should be viewed as complex fluids. | 4,497 |
spheres We a dielectric. present variational treatment a of in hard frictional | We present a variational treatment of hard spheres in a frictional dielectric. | 4,498 |
this we coefficient feature In method, multiple using weight of correlations. the | In this method, we weight the feature using coefficient of multiple correlations. | 4,499 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.