text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
software A fight is to aging primitive against software method rejuvenation. | A primitive method to fight against software aging is software rejuvenation. | 4,500 |
stopping software, It internal it. occasionally its and the cleaning state running restarting involves | It involves occasionally stopping the running software, cleaning its internal state and restarting it. | 4,501 |
was Environment) used of simulation Application implementation for Development (Java JADE and cooperation. agents | JADE (Java Application Development Environment) was used for implementation and simulation of agents cooperation. | 4,502 |
as set valuated in of are formulas. properties interpreted Data | Data in properties are interpreted as set of valuated formulas. | 4,503 |
and handwriting: offline. of on-line Two types | Two types of handwriting: on-line and offline. | 4,504 |
handwriting off-line most recognition purpose in and is protection of important authentication. The systems | The most important purpose of off-line handwriting recognition is in protection systems and authentication. | 4,505 |
scripts. scripts much to comparison in Arabic Handwriting more Latin are complicated | Arabic Handwriting scripts are much more complicated in comparison to Latin scripts. | 4,506 |
methodology introduces This to Arabic a characters. paper simple authenticate and novel handwriting | This paper introduces a simple and novel methodology to authenticate Arabic handwriting characters. | 4,507 |
database. character our we our aim, built Reaching own | Reaching our aim, we built our own character database. | 4,508 |
show tractable. this that parameter We detecting autocatalytic sets fixed is case in | We show that in this case detecting autocatalytic sets is fixed parameter tractable. | 4,509 |
its forms. free degrades The bound and protein in | The protein degrades in its free and bound forms. | 4,510 |
balance This breaks reaction bimolecular involves step. and network detailed a single | This network breaks detailed balance and involves a single bimolecular reaction step. | 4,511 |
for proposed (PA) detail is various images tested on varying noises. algorithm The | The proposed algorithm (PA) is tested on varying detail images for various noises. | 4,512 |
histone quantum proposed. is A mechanical on model modification | A quantum mechanical model on histone modification is proposed. | 4,513 |
are deduced. histone dependence The and coherence-length dependence modification the of temperature | The temperature dependence and the coherence-length dependence of histone modification are deduced. | 4,514 |
predicted. level The histone is the temperature of non-Arhenius modification dependence | The non-Arhenius temperature dependence of the histone modification level is predicted. | 4,515 |
from however, genetic remains these a data, task. relationships Inferring challenging | Inferring these relationships from genetic data, however, remains a challenging task. | 4,516 |
sequences structures torsional non-canonical (IR) DNA repeat can Inverted stress. relieve to form cruciform in | Inverted repeat (IR) sequences in DNA can form non-canonical cruciform structures to relieve torsional stress. | 4,517 |
architecture experimental A.I. of theoretical of approach aspects This whole describes the the the | This approach describes the theoretical aspects of the architecture of the whole experimental A.I. | 4,518 |
uses to research signals. the A of measure new compression methods line similarity between | A new line of research uses compression methods to measure the similarity between signals. | 4,519 |
Our generalization anytime performance is represented algorithm composing by conditional of a approach profiles. | Our approach is a generalization of composing anytime algorithm represented by conditional performance profiles. | 4,520 |
electrophoresis proteomics. been gel has Two-dimensional the instrumental of in development | Two-dimensional gel electrophoresis has been instrumental in the development of proteomics. | 4,521 |
with without regard models Graphical doing learned inference cost are of usually to the them. | Graphical models are usually learned without regard to the cost of doing inference with them. | 4,522 |
and of (TPLP). appear Theory To Practice in Logic Programming | To appear in Theory and Practice of Logic Programming (TPLP). | 4,523 |
provide facts of from conditional a rules deriving d-separation The independence model for framework structure. | The rules of d-separation provide a framework for deriving conditional independence facts from model structure. | 4,524 |
directed to only this models. simple However, applies graphical theory | However, this theory only applies to simple directed graphical models. | 4,525 |
deriving theory in d-separation, independence models. relational conditional for relational We introduce a | We introduce relational d-separation, a theory for deriving conditional independence in relational models. | 4,526 |
for image The estimation. inverse primary was PSF used | The inverse PSF was used for primary image estimation. | 4,527 |
by variations of condition process on The basing was convergence. defined dynamic balance regularization iteration | The variations balance was defined by dynamic regularization basing on condition of iteration process convergence. | 4,528 |
variations. regularization previous dynamic character estimate image because on depends current has The and | The regularization has dynamic character because depends on current and previous image estimate variations. | 4,529 |
on optimal is target fluctuations invariance of functional basing to value. It argument | It is basing on target functional invariance to fluctuations of optimal argument value. | 4,530 |
in perform nearly as as hindsight. the best well to aims Online hypothesis learning | Online learning aims to perform nearly as well as the best hypothesis in hindsight. | 4,531 |
hypothesis though, hypothesis challenging. the offline some For even best is classes, finding | For some hypothesis classes, though, even finding the best hypothesis offline is challenging. | 4,532 |
offline guaranteed. local techniques local employed are search cases, only optimality often and In such | In such offline cases, local search techniques are often employed and only local optimality guaranteed. | 4,533 |
minimize We local with then algorithm graphs. a to present general arbitrary locality regret | We then present a general algorithm to minimize local regret with arbitrary locality graphs. | 4,534 |
drastically speed to We how learning. structure graph can show also be exploited the | We also show how the graph structure can be exploited to drastically speed learning. | 4,535 |
is variable R presented. linear estimating for latent and An models specifying package | An R package for specifying and estimating linear latent variable models is presented. | 4,536 |
methods This several compared networks. to other is approach known on | This approach is compared to several other methods on known networks. | 4,537 |
ALP proposes This approximation. a paper new | This paper proposes a new ALP approximation. | 4,538 |
LP for structure the This solving allows efficiently. new | This structure allows for solving the new LP efficiently. | 4,539 |
aspects of and study the both approach. We practical proposed theoretical | We study both practical and theoretical aspects of the proposed approach. | 4,540 |
subgraphs patterns of networks. Motifs complex are of | Motifs are patterns of subgraphs of complex networks. | 4,541 |
prevalence chain to Specifically, diverging of the correlation. increase motifs and tends | Specifically, the prevalence of diverging and chain motifs tends to increase correlation. | 4,542 |
correctness its for proved. provided multiplicative is is and inference An models algorithm | An inference algorithm for multiplicative models is provided and its correctness is proved. | 4,543 |
and examples the models with beneficial. algorithm ends new where The using paper computationally is | The paper ends with examples where using the new models and algorithm is computationally beneficial. | 4,544 |
importance models. paper introduces The probabilistic sampling for graphical AND/OR | The paper introduces AND/OR importance sampling for probabilistic graphical models. | 4,545 |
The entities trainer is two and evaluator. different of system composed | The system is composed of two different entities trainer and evaluator. | 4,546 |
in of terms of interaction variety accuracy and We our measure classification scenarios. | We measure our accuracy in terms of variety of interaction and classification scenarios. | 4,547 |
For BN. higher with BNs quickly datasets, BDeu finds 'true' the than most MaxWalkSat score | For most datasets, MaxWalkSat quickly finds BNs with higher BDeu score than the 'true' BN. | 4,548 |
effect information The is assessed. adding of prior | The effect of adding prior information is assessed. | 4,549 |
this the RIS result derive we theoretic Based algorithm. on | Based on this theoretic result we derive the RIS algorithm. | 4,550 |
polyacrylamide to electrophoretic proteins gels. is used on separation staining after detect Silver | Silver staining is used to detect proteins after electrophoretic separation on polyacrylamide gels. | 4,551 |
Both features optimized are are proposed. silver in this discussed staining protocols and chapter, | Both features are discussed in this chapter, and optimized silver staining protocols are proposed. | 4,552 |
new portfolios. for and present techniques designing We evaluate algorithm | We present and evaluate new techniques for designing algorithm portfolios. | 4,553 |
machine scheduling aspect. In a learning problem the aspect our view, a and both has | In our view, the problem has both a scheduling aspect and a machine learning aspect. | 4,554 |
in addressed largely has the Prior work two aspects of one isolation. | Prior work has largely addressed one of the two aspects in isolation. | 4,555 |
enumerated. on medium-size state fully can problems focus space be whose We | We focus on medium-size problems whose state space can be fully enumerated. | 4,556 |
important applications, has planning and navigation under problem such numerous as This uncertainty. | This problem has numerous important applications, such as navigation and planning under uncertainty. | 4,557 |
by decomposing simpli the often be smaller task tasks arranged can Planning into ed hierarchically. | Planning can often be simpli ed by decomposing the task into smaller tasks arranged hierarchically. | 4,558 |
line Toussaint research, al. another of In et | In another line of research, Toussaint et al. | 4,559 |
techniques approach based non-convex that this on than better scales demonstrate optimization. Experimental results previous | Experimental results demonstrate that this approach scales better than previous techniques based on non-convex optimization. | 4,560 |
models is in One cell of in of application proliferation. studies of field biology such | One field of application of such models in biology is in studies of cell proliferation. | 4,561 |
are effects-based with problem diagrams experiments an military planning discussed. issues random and and Complexity | Complexity issues and experiments with random diagrams and an effects-based military planning problem are discussed. | 4,562 |
Eberhardt builds insights in gained analysis case on from The et worst al. the algorithm | The algorithm builds on insights gained from the worst case analysis in Eberhardt et al. | 4,563 |
that conjecture correct. suggests our A is simulation | A simulation suggests that our conjecture is correct. | 4,564 |
challenge. characterization be will Systematic a these of tremendous transcripts | Systematic characterization of these transcripts will be a tremendous challenge. | 4,565 |
of in study the model. sharing we Wright-Fisher the distribution Here, IBD | Here, we study the distribution of IBD sharing in the Wright-Fisher model. | 4,566 |
the normally. sharing large approximately We find that for distributed cohort-averaged is cohorts, | We find that for large cohorts, the cohort-averaged sharing is distributed approximately normally. | 4,567 |
is that comparison visualization necessary. images of indicates some a three-dimensional The | The comparison of some images indicates that a three-dimensional visualization is necessary. | 4,568 |
be of terminals retinal well-segregated to origin. We find eye the by | We find the retinal terminals to be well-segregated by eye of origin. | 4,569 |
subdomains It functional sublaminae. distinct these represent whether be determined remains to | It remains to be determined whether these subdomains represent distinct functional sublaminae. | 4,570 |
method using for signal fast Bayesian introduced a sparse pursuit A is matching recovery. approach | A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. | 4,571 |
proposed demonstrate estimator. power results the Simulation robustness our of and | Simulation results demonstrate the power and robustness of our proposed estimator. | 4,572 |
initialization proposed also is hierarchical the random for simple algorithm. and A effective EM | A simple and effective hierarchical random initialization is also proposed for the EM algorithm. | 4,573 |
novel real in some to model-based applications is data. illustrated clustering technique The | The novel model-based clustering technique is illustrated in some applications to real data. | 4,574 |
equipped parameter scaling The a is conjugate partially with prior. | The scaling parameter is equipped with a partially conjugate prior. | 4,575 |
that the illustrate examples give Some satisfactory method results. can | Some examples illustrate that the method can give satisfactory results. | 4,576 |
another a with comparison these well. In as existing made examples is method | In these examples a comparison is made with another existing method as well. | 4,577 |
in by the the model. feasibility obtained structure Computational local GAI is exploiting | Computational feasibility is obtained by exploiting the local GAI structure in the model. | 4,578 |
in The disease of Parkinson's unknown. tremor origin exact remains | The exact origin of tremor in Parkinson's disease remains unknown. | 4,579 |
in our everyday lives. play Preferences important role an | Preferences play an important role in our everyday lives. | 4,580 |
exist CPnets. for algorithms for but CP-nets, incomplete multi-valued Tractable these algorithms binary are | Tractable algorithms exist for binary CP-nets, but these algorithms are incomplete for multi-valued CPnets. | 4,581 |
effective POMDPs decentralized (MBDP) solving has in Memory-Bounded with Dynamic large horizons. Programming extremely proved | Memory-Bounded Dynamic Programming (MBDP) has proved extremely effective in solving decentralized POMDPs with large horizons. | 4,582 |
larger To benchmark problem. the the improvements, new, effectiveness of evaluate we introduce a | To evaluate the effectiveness of the improvements, we introduce a new, larger benchmark problem. | 4,583 |
is biological of to large DNA wide processes. deformations subject in a range | DNA is subject to large deformations in a wide range of biological processes. | 4,584 |
persons systems disabilities for (e.g. with Assistive cognitive | Assistive systems for persons with cognitive disabilities (e.g. | 4,585 |
for POMDPs and very labour definition a usually their procedure construction. require Unfortunately, intensive, manual | Unfortunately, POMDPs usually require a very labour intensive, manual procedure for their definition and construction. | 4,586 |
Assistance a call the resulting We POMDP SNAP Process). (SyNdetic | We call the resulting POMDP a SNAP (SyNdetic Assistance Process). | 4,587 |
a had manually expert. To performed to be trained date, by POMDP this translation | To date, this translation had to be performed manually by a trained POMDP expert. | 4,588 |
method tasks non-experts. by the eliciting demonstrate assistance three from We | We demonstrate the method by eliciting three assistance tasks from non-experts. | 4,589 |
probabilistic search the various superiority approach We empirically networks. best-first demonstrate on of the | We demonstrate empirically the superiority of the best-first search approach on various probabilistic networks. | 4,590 |
number new of to formulation implications. The theoretical a practical leads and | The new formulation leads to a number of theoretical and practical implications. | 4,591 |
present infinite-horizon approach We solving for POMDPs. a optimization decentralized memory-bounded | We present a memory-bounded optimization approach for solving infinite-horizon decentralized POMDPs. | 4,592 |
for state controllers. stochastic Policies represented agent finite each are by | Policies for each agent are represented by stochastic finite state controllers. | 4,593 |
are detected First, tracked. and people individually | First, people are individually detected and tracked. | 4,594 |
Mean-Shift and clustered a Second, trajectories window analyzed are their temporal using over the algorithm. | Second, their trajectories are analyzed over a temporal window and clustered using the Mean-Shift algorithm. | 4,595 |
formal Furthermore, language. propose a description we event | Furthermore, we propose a formal event description language. | 4,596 |
and The contributions. makes paper investigates this several potential | The paper investigates this potential and makes several contributions. | 4,597 |
despite this algorithm the that optimal We show converges to difference policy. the | We show that despite this difference the algorithm converges to the optimal policy. | 4,598 |
prescriptive descriptive utility and a generalisation It both provides expected enhancing of possibilities. | It provides a generalisation of expected utility enhancing both descriptive and prescriptive possibilities. | 4,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.