text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
problem. search heuristic propose different complexity issues, algorithms we After two discussing to solve the | After discussing complexity issues, we propose two different heuristic search algorithms to solve the problem. | 4,600 |
algorithms. reported, the experiments are the numerical practical of proposed efficiency showing Finally, | Finally, numerical experiments are reported, showing the practical efficiency of the proposed algorithms. | 4,601 |
such is inference. in difficulty models The main learning computational | The main computational difficulty in learning such models is inference. | 4,602 |
equivalent that is we computational loopy show procedure to this propagation. sychronous Moreover, belief | Moreover, we show that this computational procedure is equivalent to sychronous loopy belief propagation. | 4,603 |
and in inference speedup learning enables a time. dramatic This | This enables a dramatic speedup in inference and learning time. | 4,604 |
error with of even is bounds known NP-hard. probability the Computing evidence | Computing the probability of evidence even with known error bounds is NP-hard. | 4,605 |
address an this settling we problem. hard this on In by paper easier problem | In this paper we address this hard problem by settling on an easier problem. | 4,606 |
that scheme inequality. proposed Our randomized uses a is approximation the Markov importance sampling | Our proposed approximation is a randomized importance sampling scheme that uses the Markov inequality. | 4,607 |
a application bounds. to poor inequality the Markov may straight-forward lower lead of However, | However, a straight-forward application of the Markov inequality may lead to poor lower bounds. | 4,608 |
its We performance to several in practice. heuristic measures therefore improve propose | We therefore propose several heuristic measures to improve its performance in practice. | 4,609 |
of logic first-order long AI. and probability a been goal has Combining | Combining first-order logic and probability has long been a goal of AI. | 4,610 |
fall cases Many in interesting this category. | Many interesting cases fall in this category. | 4,611 |
consistent the then We measures the non-unique of set the in of structure case. examine | We then examine the structure of the set of consistent measures in the non-unique case. | 4,612 |
important non-unique phenomena, are Many MLNs including transitions, with with measures. systems represented phase by | Many important phenomena, including systems with phase transitions, are represented by MLNs with non-unique measures. | 4,613 |
Compiling been and recently especially processing. graphical intense modeling models probabilistic for under has investigation, | Compiling graphical models has recently been under intense investigation, especially for probabilistic modeling and processing. | 4,614 |
work of is networks, constraint our to generalization previous on weighted a models. This | This is a generalization of our previous work on constraint networks, to weighted models. | 4,615 |
the encouraging, of AOMDD is quite potential showing structure. the data The experimental preliminary evaluation | The preliminary experimental evaluation is quite encouraging, showing the potential of the AOMDD data structure. | 4,616 |
This paper of addresses such learning for rule the tasks. related sets problem multiple | This paper addresses the problem of learning such rule sets for multiple related tasks. | 4,617 |
exhibit learn as to that relationships parity. They "correlation-immunity", are such unable | They are unable to learn relationships that exhibit "correlation-immunity", such as parity. | 4,618 |
at Inference fastest significant computational at performed granularity, must be then this potentially cost. | Inference must then be performed at this fastest granularity, potentially at significant computational cost. | 4,619 |
inference (EP) al. Nodelman expectation-propagation et The of algorithm | The expectation-propagation (EP) inference algorithm of Nodelman et al. | 4,620 |
present this significant computational savings. can result experiments that in approach We demonstrating | We present experiments demonstrating that this approach can result in significant computational savings. | 4,621 |
belief exact BNs). Gaussian update BNs (CLG Conditional an architecture Linear for in We present | We present an architecture for exact belief update in Conditional Linear Gaussian BNs (CLG BNs). | 4,622 |
The examples. resulting benefits by are illustrated | The resulting benefits are illustrated by examples. | 4,623 |
Results of indicate the of a a performance architecture. proposed potential evaluation significant preliminary empirical | Results of a preliminary empirical performance evaluation indicate a significant potential of the proposed architecture. | 4,624 |
The complexity and of in creates many the control. management NAS difficulties | The complexity of the NAS creates many difficulties in management and control. | 4,625 |
is the problems pressing One most delay. of flight | One of the most pressing problems is flight delay. | 4,626 |
operations. passengers, complaints for airlines, and Delay creates to cost high from difficulties airport | Delay creates high cost to airlines, complaints from passengers, and difficulties for airport operations. | 4,627 |
demand delay prominent. increases, problem more the becomes As on the and system more | As demand on the system increases, the delay problem becomes more and more prominent. | 4,628 |
spectrum was of tested. for inhibition However, isolates the the different | However, the spectrum of inhibition was different for the isolates tested. | 4,629 |
probabilistic is system gambles. Jensen's This axiom new by axiomatization of inspired | This new axiom system is inspired by Jensen's axiomatization of probabilistic gambles. | 4,630 |
Many are heuristic. the literature in approaches | Many approaches in the literature are heuristic. | 4,631 |
An metrics integral metric distributions. the probability Kantorovich such of component is between | An integral component of such metrics is the Kantorovich metric between probability distributions. | 4,632 |
We provide of empirical these an evaluation trade-offs. | We provide an empirical evaluation of these trade-offs. | 4,633 |
making means circumstances. a in involved offer more of calculations the certain efficient computation-intensive They | They offer a means of making the computation-intensive calculations involved more efficient in certain circumstances. | 4,634 |
as attention (in)dependence. are stochastic They special deserve asymmetric unlike they | They deserve special attention as they are asymmetric unlike stochastic (in)dependence. | 4,635 |
we a graphical on their focus develop and paper suitable, representation In this i.e. | In this paper we focus on their graphical representation and develop a suitable, i.e. | 4,636 |
take disambiguating These energy. typically time expend actions and | These disambiguating actions typically take time and expend energy. | 4,637 |
we for aid robotics. in active stereo of work, this sensing consider In vision | In this work, we consider active sensing in aid of stereo vision for robotics. | 4,638 |
for Based selection we develop sweep. a the this estimator on coefficient an result, driving | Based on this result, we develop an estimator for the selection coefficient driving a sweep. | 4,639 |
so-called to of thanks usual They all extend 'potentials'. the use algorithms elimination variable | They all extend usual variable elimination algorithms thanks to the use of so-called 'potentials'. | 4,640 |
ratchet. restoring force delayed speeds This Muller's up | This delayed restoring force speeds up Muller's ratchet. | 4,641 |
much is probabilistic graphical challenge still very in models for domains. Inference large practical a | Inference for probabilistic graphical models is still very much a practical challenge in large domains. | 4,642 |
set reasoning metric with a spaces model measures. about up theoretic belief for We | We set up a model for reasoning about metric spaces with belief theoretic measures. | 4,643 |
these and in from metric. both The probability uncertainty stems spaces | The uncertainty in these spaces stems from both probability and metric. | 4,644 |
is formal constructed for reasoning A the system about logical distance. expected | A formal logical system is constructed for the reasoning about expected distance. | 4,645 |
logic. completeness are and Soundness this for shown | Soundness and completeness are shown for this logic. | 4,646 |
give of separability. equivalence the an sufficiency alternate We proof and on | We give an alternate proof on the equivalence of sufficiency and separability. | 4,647 |
whether a given testing computational present a is CPT for method separable. We | We present a computational method for testing whether a given CPT is separable. | 4,648 |
proposed samples in converge due fewer to requires The to scheme variance. sampling reduction | The proposed scheme requires fewer samples to converge due to reduction in sampling variance. | 4,649 |
presented complicated more efficient is and than the algorithm less techniques Our earlier. | Our algorithm is less complicated and more efficient than the techniques presented earlier. | 4,650 |
directed (CTBNs) Bayesian Continuous-time representations processes multi-component graphs. of as are graphical continuous-time networks Markov | Continuous-time Bayesian networks (CTBNs) are graphical representations of multi-component continuous-time Markov processes as directed graphs. | 4,651 |
in The direct among influences components. the edges network represent | The edges in the network represent direct influences among components. | 4,652 |
well. under examine which We also conditions UCT-Aux works | We also examine conditions under which UCT-Aux works well. | 4,653 |
linear programming set functions weights. to and techniques first-order of basis uses suitable determine a | a set of first-order basis functions and uses linear programming techniques to determine suitable weights. | 4,654 |
represented. covering of Through concisely approximation types are the important equivalently operators matrices, three characteristic | Through the characteristic matrices, three important types of covering approximation operators are concisely equivalently represented. | 4,655 |
decomposition. in Second, operators used boolean representations matrix matrix are approximation of covering | Second, matrix representations of covering approximation operators are used in boolean matrix decomposition. | 4,656 |
we develop algorithm decomposition. matrix And an boolean this for | And we develop an algorithm for this boolean matrix decomposition. | 4,657 |
neurophysiological a using by data. oscillator consistent model neural We do so with | We do so by using a neural oscillator model consistent with neurophysiological data. | 4,658 |
of was model the well behavioral reproduce used predictions stimulus-response shown to theory. The | The model used was shown to reproduce well the predictions of behavioral stimulus-response theory. | 4,659 |
on of This strategy the paper multi-modal functions. focuses restart on CMA-ES | This paper focuses on the restart strategy of CMA-ES on multi-modal functions. | 4,660 |
the provided, of convergence proofs including Limited is two algorithms. analysis the | Limited analysis is provided, including the convergence proofs of the two algorithms. | 4,661 |
experiments algorithms. Computer the were validate to conducted | Computer experiments were conducted to validate the algorithms. | 4,662 |
are analysis. theoretical with consistent results the The | The results are consistent with the theoretical analysis. | 4,663 |
An to in choose an open both structure. algorithms appropriate how problem been has approximation | An open problem in both algorithms has been how to choose an appropriate approximation structure. | 4,664 |
and allow free conversion energies. between GBP Reduction these EP structures on operators | Reduction operators on these structures allow conversion between EP and GBP free energies. | 4,665 |
on of continuous network. are There nodes the no placement discrete in constraints the and | There are no constraints on the placement of continuous and discrete nodes in the network. | 4,666 |
inference As exact shown intractable. previously, in is CTBNs | As shown previously, exact inference in CTBNs is intractable. | 4,667 |
solution processes new decision introduce Markov technique approximate for We a (FOMDPs). first-order | We introduce a new approximate solution technique for first-order Markov decision processes (FOMDPs). | 4,668 |
everyday characterize and discover of event-streams. activities to We different present from classes a framework | We present a framework to discover and characterize different classes of everyday activities from event-streams. | 4,669 |
representing as bags n-grams. of We event activities begin by | We begin by representing activities as bags of event n-grams. | 4,670 |
it system to entities the These evolves. track as state of of need the keep | These entities need to keep track of the state of the system as it evolves. | 4,671 |
as the beliefs being of state the system are continues Furthermore, updated. to change | Furthermore, the state of the system continues to change as beliefs are being updated. | 4,672 |
developing approaches have Previous to probabilistic used static reasoning systems models. asynchronous distributed | Previous approaches to developing distributed asynchronous probabilistic reasoning systems have used static models. | 4,673 |
results our algorithm. approach to compares favorably show frontier Experimental that the factored | Experimental results show that our approach compares favorably to the factored frontier algorithm. | 4,674 |
efiectively is the area in Solving uncertainty. of planning problems such major under a challenge | Solving such problems efiectively is a major challenge in the area of planning under uncertainty. | 4,675 |
and solution classical theory. based decentralized a is synthesis on control search heuristic of Our | Our solution is based on a synthesis of classical heuristic search and decentralized control theory. | 4,676 |
MAA* significant that advantages. Experimental show results has | Experimental results show that MAA* has significant advantages. | 4,677 |
our performance algorithms We the approximate of randomly generated inference demonstrate HMNs. on | We demonstrate the performance of our approximate inference algorithms on randomly generated HMNs. | 4,678 |
maximization to show maximization to how CTBNs. (SEM) and expectation (EM) We expectation structural apply | We show how to apply expectation maximization (EM) and structural expectation maximization (SEM) to CTBNs. | 4,679 |
of graphs, number of conditional In are only required. certain types independencies linear | In certain types of graphs, only linear number of conditional independencies are required. | 4,680 |
structural testing applications errors. linear equation The with in has correlated models result | The result has applications in testing linear structural equation models with correlated errors. | 4,681 |
solving presented were methods many for so problem. Until now this | Until now so many methods were presented for solving this problem. | 4,682 |
proposed The technique. paper based based "Color in image on (CBIR) this approach is retrieval" | The proposed approach in this paper is based on "Color based image retrieval" (CBIR) technique. | 4,683 |
discrete for far, PSR with primarily have observations. models been domains developed Thus | Thus far, PSR models have primarily been developed for domains with discrete observations. | 4,684 |
interest In human action recognition. years in considerable been has there recent | In recent years there has been considerable interest in human action recognition. | 4,685 |
the to enhance in order have approaches been analysis. automatic Several developed video | Several approaches have been developed in order to enhance the automatic video analysis. | 4,686 |
accuracy shown different results different Our found be databases. that rates can for | Our results shown that different accuracy rates can be found for different databases. | 4,687 |
We stems simplicity LARP. show calculations of the nature the that from of the | We show that the simplicity of the calculations stems from the nature of LARP. | 4,688 |
we for forms CPTs not explicit the the diagnostic Given networks. have evidence, do in | Given diagnostic evidence, we do not have explicit forms for the CPTs in the networks. | 4,689 |
derive the form the the exact of We optimal for function. importance first CPTs | We first derive the exact form for the CPTs of the optimal importance function. | 4,690 |
use their approximations. we is only Since the calculation usually hard, | Since the calculation is hard, we usually only use their approximations. | 4,691 |
review popular their point and out We limitations. several strategies | We review several popular strategies and point out their limitations. | 4,692 |
known previously upon conditions. Our results improve | Our results improve upon previously known conditions. | 4,693 |
our with seem variables binary For interactions, conditions to sharp. be (anti-)ferromagnetic | For binary variables with (anti-)ferromagnetic interactions, our conditions seem to be sharp. | 4,694 |
of tree. throughout the imposes evolution of the process evolutionary fixed rates Homogeneity | Homogeneity of the evolutionary process imposes fixed rates of evolution throughout the tree. | 4,695 |
incidence making Euclidean used. the degree grey methods, In decision in four-dimensional space these is | In these decision making methods, the grey incidence degree in four-dimensional Euclidean space is used. | 4,696 |
final method. obtained The arrangement result Borda weighted is by | The final arrangement result is obtained by weighted Borda method. | 4,697 |
proposed the approach. An the of illustrates example applicability | An example illustrates the applicability of the proposed approach. | 4,698 |
example proposed approach. applicability of the the shows An | An example shows the applicability of the proposed approach. | 4,699 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.