text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
We by sets that prove reduct (resp. answer | We prove that answer sets by reduct (resp. | 3,600 |
by are weakly complement) to (resp. equivalent | by complement) are equivalent to weakly (resp. | 3,601 |
fundamental ecosystem Understanding affects to event an is extinction biodiversity conservation. how | Understanding how an extinction event affects ecosystem is fundamental to biodiversity conservation. | 3,602 |
pure scenario. best This represents topological case statement the | This pure topological statement represents the best case scenario. | 3,603 |
for local sufficient proliferation diffusion. precondition is global the | sufficient local proliferation is the precondition for global diffusion. | 3,604 |
global diffusion. control controlling The strategies for chance design disease provide to results gradient a | The results provide a chance to design gradient control strategies for controlling disease global diffusion. | 3,605 |
of the pathology presented. patients Results on gastrointestinal in are studies psoriatic | Results of the studies on gastrointestinal pathology in psoriatic patients are presented. | 3,606 |
practical model confirmed The of is clinical the work. by validity of results the | The validity of the model is confirmed by the results of practical clinical work. | 3,607 |
algorithm. also overfitting greedy such of a fighting We problem the address in | We also address the problem of fighting overfitting in such a greedy algorithm. | 3,608 |
was conceived constructed as Planning originally the a International for franca lingua and Competition. PDDL | PDDL was originally conceived and constructed as a lingua franca for the International Planning Competition. | 3,609 |
Most for each activity. classical assume formulations and scheduling fixed duration known a | Most classical scheduling formulations assume a fixed and known duration for each activity. | 3,610 |
are of ones achieving have good probability best makespan. which solutions a a high The | The best solutions are ones which have a high probability of achieving a good makespan. | 3,611 |
a by linear polyhedron convex defined Let be of $K$ inequalities. closed number finite a | Let $K$ be a closed convex polyhedron defined by a finite number of linear inequalities. | 3,612 |
and an on outer particular, is in the direction. perturbation In that we lexicographic focus | In particular, we focus on the perturbation that is lexicographic and in an outer direction. | 3,613 |
The the outperforms our deconvolution show previous method on that some problem numerical results ones. | The numerical results on the deconvolution problem show that our method outperforms some previous ones. | 3,614 |
exploiting inference convergence improves algorithms. It by memory-based | It improves convergence by exploiting memory-based inference algorithms. | 3,615 |
first algorithms step generic are a towards and unified algorithms. variable Our elimination backtrack | Our backtrack and variable elimination generic algorithms are a first step towards unified algorithms. | 3,616 |
optimization fuzzy paper system for optimization. methods inference This various compares | This paper compares various optimization methods for fuzzy inference system optimization. | 3,617 |
annealing. algorithm, methods swarm The optimization particle optimization are simulated genetic and compared | The optimization methods compared are genetic algorithm, particle swarm optimization and simulated annealing. | 3,618 |
the We with random study transition instances. associated QXORSAT phase | We study the phase transition associated with random QXORSAT instances. | 3,619 |
planning. actions constraints temporal to durations, an When adds such extra handling have difficulty | When actions have durations, handling such temporal constraints adds an extra difficulty to planning. | 3,620 |
performance experiments Additional planner. the show our reasoning good of temporal into the integrated techniques | Additional experiments show the good performance of the temporal reasoning techniques integrated into our planner. | 3,621 |
show a We language. each of defines generates and algorithms propositional that these | We show that each of these algorithms defines and generates a propositional language. | 3,622 |
methods these We problems evaluate inference in simulation several on a challenging study. | We evaluate these methods on several challenging inference problems in a simulation study. | 3,623 |
is of the number solutions search. maintained A small these "elite during | A small number of these "elite solutions is maintained during the search. | 3,624 |
an its used. overview provide algorithms architecture detailing of behaviour, the search and We | We provide an overview of its architecture and search behaviour, detailing the algorithms used. | 3,625 |
In problems. address paper we this both | In this paper we address both problems. | 3,626 |
Thus, are additional features. with they unified extended and | Thus, they are unified and extended with additional features. | 3,627 |
completeness of algorithm LRTS Second, any prove and the we framework. convergence covered by | Second, we prove completeness and convergence of any algorithm covered by the LRTS framework. | 3,628 |
upper-bounds and the relating prove several solution parameters Third, control we quality. | Third, we prove several upper-bounds relating the control parameters and solution quality. | 3,629 |
theory community population Applications are genetics, evolutionary to and discussed. game ecology, | Applications to community ecology, population genetics, and evolutionary game theory are discussed. | 3,630 |
approaches then previous SSA. in We with estimator this compare simulations optimization-based for | We then compare this estimator in simulations with previous optimization-based approaches for SSA. | 3,631 |
paper using the model dynamical epidemiological In susceptible-infectious (SI) study we this graphs. | In this paper we study the susceptible-infectious (SI) epidemiological model using dynamical graphs. | 3,632 |
including systems. have been applied areas complex in recently many Dynamical structures | Dynamical structures have been recently applied in many areas including complex systems. | 3,633 |
of parameter the disease. This infectivity includes also the regarding information | This parameter includes also information regarding the infectivity of the disease. | 3,634 |
unstable. However, high classifier of in the is dimensions provably the very performance | However, the performance of the classifier in very high dimensions is provably unstable. | 3,635 |
adaptive intrinsic is We regression to k-NN that also show dimension. | We show that k-NN regression is also adaptive to intrinsic dimension. | 3,636 |
matrix Dung's theory the argumentation framework. and introduce of We to its block | We introduce matrix and its block to the Dung's theory of argumentation framework. | 3,637 |
argumentation a provide the mathematics way "controversial determine This to framework. arguments" in an powerful | This provide a powerful mathematics way to determine the "controversial arguments" in an argumentation framework. | 3,638 |
different terms can be expansion in of interpreted paths cells. readily between This | This expansion can be readily interpreted in terms of paths between different cells. | 3,639 |
for networks. We then expressions derive correlation randomly structure in average explicit the connected | We then derive explicit expressions for the average correlation structure in randomly connected networks. | 3,640 |
objective is images required. assessment an for fusion the spatial quality resolution of Therefore, | Therefore, an objective quality of the spatial resolution assessment for fusion images is required. | 3,641 |
detection, CPU. both the on tracked After are hands the | After the detection, both hands are tracked on the CPU. | 3,642 |
paper has figure . This due withdrawn a to by missing author been the | This paper has been withdrawn by the author due to a missing figure . | 3,643 |
kernel multiple a We problem. the learning Gaussian of formulation consider process | We consider a Gaussian process formulation of the multiple kernel learning problem. | 3,644 |
function to process is construction imposing equivalent space. over product priors a This of heavy-tailed | This construction is equivalent to imposing a product of heavy-tailed process priors over function space. | 3,645 |
and is variational classification. regression algorithm A derived binary for inference | A variational inference algorithm is derived for regression and binary classification. | 3,646 |
algorithms thousand. larger to in dimensions trouble have Existing a scaling than | Existing algorithms have trouble in scaling to dimensions larger than a thousand. | 3,647 |
ideas. new key This requires a few | This requires a few key new ideas. | 3,648 |
centrality The concerned first the community. in distribution the of | The first concerned the distribution of centrality in the community. | 3,649 |
paper novel recognition approach for a solving present problem. The will face | The paper will present a novel approach for solving face recognition problem. | 3,650 |
reduced indirect side models. the for the is strongly This to intermediate of as ability | This ability is strongly reduced as for the intermediate to indirect side of the models. | 3,651 |
comparing approach to our a methods. We also simulation provide study existing | We also provide a simulation study comparing our approach to existing methods. | 3,652 |
is marked conventional Performance classification schemes. bench- against | Performance is bench- marked against conventional classification schemes. | 3,653 |
interactions protein the interesting post-genomic is challenges of of Predicting era. the one more | Predicting protein interactions is one of the more interesting challenges of the post-genomic era. | 3,654 |
PPI. are predictions framework of one Importantly component however, for identifying larger a computational only | Importantly however, computational predictions are only one component of a larger framework for identifying PPI. | 3,655 |
network. density protein-protein We synaptic post interactions predicting good PPI show results for | We show good results predicting protein-protein interactions for post synaptic density PPI network. | 3,656 |
a have de-noising multitude of methods proposed been of In hitherto. MRI, the field image | In the field of MRI, a multitude of image de-noising methods have been proposed hitherto. | 3,657 |
the paper of present the two-fold. contribution is Accordingly, | Accordingly, the contribution of the present paper is two-fold. | 3,658 |
solvers Designing is a component-based constraint complex problem. | Designing component-based constraint solvers is a complex problem. | 3,659 |
the there components required, are between interdependencies optional some components. Some and are are | Some components are required, some are optional and there are interdependencies between the components. | 3,660 |
of ad-hoc this, and limited. solver approaches have to and modification previous Because design been | Because of this, previous approaches to solver design and modification have been ad-hoc and limited. | 3,661 |
valid a solver. of description problem Solving yields the this | Solving this problem yields the description of a valid solver. | 3,662 |
appearance intoxication. also noted test feeling of persons the a The alcohol of subjective | The test persons also noted the appearance of a subjective feeling of alcohol intoxication. | 3,663 |
are for Three procedures presented. and models constraint novel several shaving programming these models | Three novel constraint programming models and several shaving procedures for these models are presented. | 3,664 |
approach heuristic was the Previously, only a algorithm. available | Previously, the only available approach was a heuristic algorithm. | 3,665 |
previous to protein linking of organisms. the aggregation summarizes This work heterozygosity paper | This paper summarizes previous work linking protein aggregation to the heterozygosity of organisms. | 3,666 |
inhibit heterozygosity aggregation. to protein can Organisms employ | Organisms can employ heterozygosity to inhibit protein aggregation. | 3,667 |
diploid synthesize be to complex tend because Hence, aggregation-prone they proteins. organisms tend to long, | Hence, complex organisms tend to be diploid because they tend to synthesize long, aggregation-prone proteins. | 3,668 |
theory with level. also of explain may The organisms associated ecological trends ploidy different | The theory may also explain ecological trends associated with organisms of different ploidy level. | 3,669 |
with We for new observability. no present planning probabilistic a algorithm | We present a new algorithm for probabilistic planning with no observability. | 3,670 |
the infeasible all however, This computation, but smallest problems. is for | This computation, however, is infeasible for all but the smallest problems. | 3,671 |
approximate that analyze we allow various Therefore, for efficient Q-value computation. functions | Therefore, we analyze various approximate Q-value functions that allow for efficient computation. | 3,672 |
then gain a from We control. dynamical implements first that principles model design nonlinear | We then design from first principles a nonlinear dynamical model that implements gain control. | 3,673 |
models equations. identification expressed to come differential Typically, the mean has this as quantitative of | Typically, this has come to mean the identification of quantitative models expressed as differential equations. | 3,674 |
relationships by between the we machine of experimentally structural the variables. identification observed Specifically, examine | Specifically, we examine the identification by machine of the structural relationships between experimentally observed variables. | 3,675 |
form These expressed model. qualitative will of be relationship a quantitative of the in abstractions | These relationship will be expressed in the form of qualitative abstractions of a quantitative model. | 3,676 |
problem. planning decentralized as formally in can Multi-agent stochastic framed environments Markov a decision be | Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. | 3,677 |
an optimally mechanism show to is finding Dec-SMDP-Com. a equivalent optimal We solving that | We show that finding an optimal mechanism is equivalent to solving optimally a Dec-SMDP-Com. | 3,678 |
converges search provide on algorithm that the decomposition. heuristic a optimal We also | We also provide a heuristic search algorithm that converges on the optimal decomposition. | 3,679 |
results good provide show these that Empirical approximate solutions. approaches | Empirical results show that these approaches provide good approximate solutions. | 3,680 |
expressive queries an an Logics play language for Description (DLs). as Conjunctive important query role | Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). | 3,681 |
co-NP. complexity, data containment we Regarding in prove | Regarding data complexity, we prove containment in co-NP. | 3,682 |
with graphs. present three problems for complexity planning causal classes simple results We new of | We present three new complexity results for classes of planning problems with simple causal graphs. | 3,683 |
we hierarchies adding these extend and number Then role results finally restrictions. by | Then we extend these results by adding role hierarchies and finally number restrictions. | 3,684 |
intractable. combined Complete search becomes state-space soon the of | Complete search of the combined state-space soon becomes intractable. | 3,685 |
space a search in Planning the configurations. becomes smaller much of then subgraph | Planning then becomes a search in the much smaller space of subgraph configurations. | 3,686 |
blocks and are Web building initiative. the the automated of reasoning Ontologies Semantic | Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. | 3,687 |
disjunctive We terms, Q-resolution for introduce formulas normal form. used to be in on | We introduce Q-resolution on terms, to be used for formulas in disjunctive normal form. | 3,688 |
signatures, for the algorithm. is data based on used Simulated evaluating proposed the measured spectral | Simulated data based on the measured spectral signatures, is used for evaluating the proposed algorithm. | 3,689 |
method state-of-the-art in We field. that the outperforms the method our show significantly | We show that our method significantly outperforms the state-of-the-art method in the field. | 3,690 |
birth presence processes. and of recruitment death model social in adaptive the We in networks | We model recruitment in adaptive social networks in the presence of birth and death processes. | 3,691 |
nodes recruited. subset a of can be susceptible Only | Only a susceptible subset of nodes can be recruited. | 3,692 |
system. compared direct are theoretical with simulations predictions of The the full | The theoretical predictions are compared with direct simulations of the full system. | 3,693 |
formulated Eiter al.} {\em et the logic (dl-programs) programs semantics by set Description under answer | Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\em et al.} | 3,694 |
bases. been rules integrating considered formalism and as for a prominent ontology have knowledge | have been considered as a prominent formalism for integrating rules and ontology knowledge bases. | 3,695 |
dl-programs logic. In study of this the into default paper, we embedding possibility | In this paper, we study the possibility of embedding dl-programs into default logic. | 3,696 |
multiple current sufficient classes. slow or not can However, for be methods too distinguishing | However, current methods can be too slow or not sufficient for distinguishing multiple classes. | 3,697 |
interoperability the importantly, semantic services. More and they also integration e-government facilitate of | More importantly, they also facilitate the semantic integration and interoperability of e-government services. | 3,698 |
using methods. a aggregation theory We mechanical statistical develop of | We develop a theory of aggregation using statistical mechanical methods. | 3,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.