text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
the We propagation MSBNs. Shafer-Shenoy in apply and inference to lazy | We apply the Shafer-Shenoy and lazy propagation to inference in MSBNs. | 5,900 |
solving search algorithms approaches among Stochastic hard most are combinatorial the sucessful for problems. | Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. | 5,901 |
present a recognition. abductive, theory of probabilistic We new plan | We present a new abductive, probabilistic theory of plan recognition. | 5,902 |
that There inference is really evidence matter. in numbers the don't probabilistic | There is evidence that the numbers in probabilistic inference don't really matter. | 5,903 |
reliable. equally not are or experts equally Criteria are important, competent not | Criteria are not equally important, experts are not equally competent or reliable. | 5,904 |
decisions as planning. of becoming are (MDPs) increasing theoretic models Markov decision processes popular | Markov decisions processes (MDPs) are becoming increasing popular as models of decision theoretic planning. | 5,905 |
for belief is approximation of investigated. A foundation functions and proposed conceptual | A conceptual foundation for approximation of belief functions is proposed and investigated. | 5,906 |
consistency the requirements of and closeness. based It on is | It is based on the requirements of consistency and closeness. | 5,907 |
of approximation the out optimal Unfortunately, be computation intractable. the to turns | Unfortunately, the computation of the optimal approximation turns out to be intractable. | 5,908 |
are the belief methods approximations to compared functions. proposed These earlier of | These methods are compared to the earlier proposed approximations of belief functions. | 5,909 |
the information the in logic. of addresses This paper problem merging framework of uncertain possibilistic | This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. | 5,910 |
the logic. the These rules combination first at language meta-level possibilistic outside described are of | These combination rules are first described at the meta-level outside the language of possibilistic logic. | 5,911 |
uncertain are or decision processes domains often formulated Decision-making Markov stochastic (MDPs). in as problems | Decision-making problems in uncertain or stochastic domains are often formulated as Markov decision processes (MDPs). | 5,912 |
model promising reasoning knowledge. is a with uncertain Argumentation for | Argumentation is a promising model for reasoning with uncertain knowledge. | 5,913 |
bases. with context the is approach of knowldge illustrated in Our stratified reasoning | Our approach is illustrated in the context of reasoning with stratified knowldge bases. | 5,914 |
to optimal instance. compare the each each and to outcomes for other We their policies | We compare their outcomes to each other and to the optimal policies for each instance. | 5,915 |
technique existing POMDP algorithms. into iteration can The value any incorporated be easily | The technique can be easily incorporated into any existing POMDP value iteration algorithms. | 5,916 |
of can pruning orders We magnitude the several incremental run make that find technique faster. | We find that the technique can make incremental pruning run several orders of magnitude faster. | 5,917 |
of probabilities general for in exact updating exist algorithms two Networks. There Bayesian forms | There exist two general forms of exact algorithms for updating probabilities in Bayesian Networks. | 5,918 |
preferences. about normative a complex Classical Decision representing for and reasoning provides framework Theory | Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. | 5,919 |
set set. rough captures of in elements indiscernibility of a notion The | The notion of rough set captures indiscernibility of elements in a set. | 5,920 |
real between the universes. many situations, relation establishes an information But, in life different system | But, in many real life situations, an information system establishes the relation between different universes. | 5,921 |
and an task recognition in (FR) Face is vision. computer important pattern recognition | Face recognition (FR) is an important task in pattern recognition and computer vision. | 5,922 |
for powerful been to framework be demonstrated (SR) has representation Sparse FR. a | Sparse representation (SR) has been demonstrated to be a powerful framework for FR. | 5,923 |
a hint. coefficients recognition provide representation then sparse The | The sparse representation coefficients then provide a recognition hint. | 5,924 |
based basic SR on a sparse Early algorithms model. are | Early SR algorithms are based on a basic sparse model. | 5,925 |
many has based which proposed a algorithms. framework, recently BSBL block-sparse-model is advantages existing over | BSBL is a recently proposed framework, which has many advantages over existing block-sparse-model based algorithms. | 5,926 |
HORSES implement procedure. We algorithm efficient to construct the an | We construct an efficient algorithm to implement the HORSES procedure. | 5,927 |
The of human formal to second because is it avoids the reference definition being. concept | The second definition is formal because it avoids reference to the concept of human being. | 5,928 |
unstable, is producing activity dynamics fluctuations scale-free. are Neuronal essentially intrinsically that | Neuronal dynamics is intrinsically unstable, producing activity fluctuations that are essentially scale-free. | 5,929 |
maximal entrainment possesses itself when the natural-like, found statistics. be Response to scale-free was input | Response entrainment was found to be maximal when the input itself possesses natural-like, scale-free statistics. | 5,930 |
We methods correct this two to introduce bias. | We introduce two methods to correct this bias. | 5,931 |
techniques time co-segregating loci. selection to required in Different series detect will linked of be | Different techniques will be required to detect selection in time series of co-segregating linked loci. | 5,932 |
current discussed. of A research are number issues open | A number of current open research issues are discussed. | 5,933 |
Moreover, do not correspondences local and the these missing works handle simultaneously deformations. large | Moreover, these works do not handle simultaneously the missing correspondences and local large deformations. | 5,934 |
coupled technique high-throughput to Recently, have the we mutagenesis. | Recently, we have coupled the technique to high-throughput mutagenesis. | 5,935 |
graphical such is of characterization graphs given. A | A graphical characterization of such graphs is given. | 5,936 |
for networks It the criterion resembles locally. can implemented be and Bayesian d-separation well-known | It resembles the well-known d-separation criterion for Bayesian networks and can be implemented locally. | 5,937 |
decision are approaches limited resources. making Flexible under computations two and to approximate computation | Flexible and approximate computations are two approaches to decision making under limited computation resources. | 5,938 |
a an enables find computation the Approximate solution best within satisfactory to agent deadline. | Approximate computation enables an agent to find the best satisfactory solution within a deadline. | 5,939 |
NaviCell provides addition, for community-based framework In a curation. map | In addition, NaviCell provides a framework for community-based map curation. | 5,940 |
the an by integrated final is rule. map multiple scales information Finally, maximization across saliency | Finally, across multiple scales is integrated the final saliency map by an information maximization rule. | 5,941 |
paper concerned This with is finding policies optimal POMDPs. for | This paper is concerned with finding optimal policies for POMDPs. | 5,942 |
inference into evaluation reducing network influence paper diagram problems. about (ID) is (BN) Bayesian This | This paper is about reducing influence diagram (ID) evaluation into Bayesian network (BN) inference problems. | 5,943 |
class functional (i.e. a class between algebra correspondence produces algebraic class's a definition Moreover, | Moreover, class algebra produces a functional correspondence between a class's class algebraic definition (i.e. | 5,944 |
set "intent") (i.e. the expression of the all satisfy instances and which its | its "intent") and the set of all instances which satisfy the expression (i.e. | 5,945 |
in definitions. various locating thus and provides assistance counterexamples The framework examples quickly of | The framework thus provides assistance in quickly locating examples and counterexamples of various definitions. | 5,946 |
provide on regions of generated evaluation networks. empirical preliminary completeness and randomly identify We | We identify regions of completeness and provide preliminary empirical evaluation on randomly generated networks. | 5,947 |
many the remain address environments. but latter in a problem papers Earlier problems, dropouts | Earlier papers address the latter problems, but dropouts remain a problem in many environments. | 5,948 |
correlated with not presented to actions able as effects. The deal is algorithm with | The algorithm as presented is not able to deal with actions with correlated effects. | 5,949 |
that corrects weakness. new this describe a regression operator theoretic We decision | We describe a new decision theoretic regression operator that corrects this weakness. | 5,950 |
a straightforward, technical approach. extension complicated more somewhat While conceptually requires this | While conceptually straightforward, this extension requires a somewhat more complicated technical approach. | 5,951 |
for problems. solving among best computationally reasoning search hard are the and Stochastic algorithms | Stochastic algorithms are among the best for solving computationally hard search and reasoning problems. | 5,952 |
a The procedures of by characterized random variable. runtime is such | The runtime of such procedures is characterized by a random variable. | 5,953 |
algorithms distributions. Different to rise give different probability | Different algorithms give rise to different probability distributions. | 5,954 |
genetic is is Most inference evolution on rare. based adaptive assuming frameworks population | Most population genetic inference is based on frameworks assuming adaptive evolution is rare. | 5,955 |
presently solving most for method find is incremental efficient the POMDPs. pruning that exact We | We find that incremental pruning is presently the most efficient exact method for solving POMDPs. | 5,956 |
for of Two considered. models are local approaches combination | Two approaches for combination of local models are considered. | 5,957 |
perturbation calculation for We variances, of global models. bounds and also discuss and utilities expected | We also discuss calculation of bounds for expected utilities and variances, and global perturbation models. | 5,958 |
of is of diversity principle FIS representation formulated. construction The | The principle of representation diversity of FIS construction is formulated. | 5,959 |
the of paper neural i.e. suggests Besides the elements, structure | Besides the paper suggests the structure of neural elements, i.e. | 5,960 |
FIS and the construction. for are that detectors basis processors zone | zone detectors and processors that are the basis for FIS construction. | 5,961 |
this empirical The encouraging. are results of study very | The results of this empirical study are very encouraging. | 5,962 |
with the BKBs consistent requires in most Reasoning evidence. finding inferences the probable | Reasoning in BKBs requires finding the most probable inferences consistent with the evidence. | 5,963 |
to performance significantly when applied that shows cost-sharing evaluation BKBs. Empirical improves | Empirical evaluation shows that cost-sharing improves performance significantly when applied to BKBs. | 5,964 |
Image played in image has thresholding an important role segmentation. | Image thresholding has played an important role in image segmentation. | 5,965 |
images been with approach (THFCM). through Experimental have obtained results proposed test standard the | Experimental results with standard test images have been obtained through the proposed approach (THFCM). | 5,966 |
but provide We efficient a procedure for also simple nonuniform partition. | We also provide a simple but efficient procedure for nonuniform partition. | 5,967 |
evidence converges. We that empirical algorithm the provide | We provide empirical evidence that the algorithm converges. | 5,968 |
key motivate triage trauma-care We ideas in and of context the decisions. transportation | We motivate key ideas in the context of trauma-care triage and transportation decisions. | 5,969 |
that technique we decomposition. main a is relevance-based Our call contribution | Our main contribution is a technique that we call relevance-based decomposition. | 5,970 |
We our report empirical of significance results demonstrate of that tests approach. practical | We report results of empirical tests that demonstrate practical significance of our approach. | 5,971 |
shown paradox has not nonmonotonic logics do lottery that the Poole correctly. handle | Poole has shown that nonmonotonic logics do not handle the lottery paradox correctly. | 5,972 |
in Default common conceptual representing logic tasks. difficulties reasoning some sense encounters | Default logic encounters some conceptual difficulties in representing common sense reasoning tasks. | 5,973 |
in Image image one is the problems processing. fundamental denoising of | Image denoising is one of the fundamental problems in image processing. | 5,974 |
IQR kXk of filter. implemented window to A size was support | A window of size kXk was implemented to support IQR filter. | 5,975 |
of as outside treated IQR range the pixel. Each window is the pixel noisy kXk | Each pixel outside the IQR range of the kXk window is treated as noisy pixel. | 5,976 |
The obtained averaging. of by the was noisy pixels local estimation | The estimation of the noisy pixels was obtained by local averaging. | 5,977 |
customary Image by interpolation been has techniques. interpolation used spaciously | Image interpolation has been used spaciously by customary interpolation techniques. | 5,978 |
technique prediction. implemented widely and in has been geostatistics Kriging for simulation Recently, area | Recently, Kriging technique has been widely implemented in simulation area and geostatistics for prediction. | 5,979 |
consolidate been used proposed to miscellaneous the have test technique. images A | A miscellaneous test images have been used to consolidate the proposed technique. | 5,980 |
are systems an Valuation based property studied. verifying idempotent | Valuation based systems verifying an idempotent property are studied. | 5,981 |
between structure. the lattice a order A them valuations partial giving defined is | A partial order is defined between the valuations giving them a lattice structure. | 5,982 |
efficient in computations carry an way. is It to both representations studied how out with | It is studied how to carry out computations with both representations in an efficient way. | 5,983 |
of cases convex particular are sets considered. and The finite polytopes | The particular cases of finite sets and convex polytopes are considered. | 5,984 |
independence role paper explores of This in causal influence network (ICI) of inference. the Bayesian | This paper explores the role of independence of causal influence (ICI) in Bayesian network inference. | 5,985 |
smaller factorize conditional table to allows into ICI pieces. probability a one | ICI allows one to factorize a conditional probability table into smaller pieces. | 5,986 |
imprecise overwhelming information risk operator. increases of the This proliferation the of | This proliferation of imprecise information increases the risk of overwhelming the operator. | 5,987 |
at Horizon software stage. is prototype The currently | The Horizon software is currently at prototype stage. | 5,988 |
on this Based a is indication, causality definition subjective of forwarded. | Based on this indication, a subjective definition of causality is forwarded. | 5,989 |
discussed. Finally, claims these of accuracy the are for further methods testing | Finally, methods for further testing the accuracy of these claims are discussed. | 5,990 |
events. on to new multiple random developed probabilistic represent A relations method is | A new method is developed to represent probabilistic relations on multiple random events. | 5,991 |
epsilon-homogeneity. a We state of introduce property call which partitions we space | We introduce a property of state space partitions which we call epsilon-homogeneity. | 5,992 |
also for The explanations. competing mechanism system will ordering a need | The system will also need a mechanism for ordering competing explanations. | 5,993 |
field Image issue is critical denoising processing. in of image a the digital | Image denoising is a critical issue in the field of digital image processing. | 5,994 |
degraded considered. with Salt images Pepper noise have been Gray-level & | Gray-level images degraded with Salt & Pepper noise have been considered. | 5,995 |
basic in construction knowledge-based of rule the unit Most model the as work knowledge. takes | Most work in knowledge-based model construction takes the rule as the basic unit of knowledge. | 5,996 |
for framework interaction. and independence asymmetric Our of representation provides intercausal canonical | Our framework provides for representation of asymmetric independence and canonical intercausal interaction. | 5,997 |
illustrated awareness. The is domain situation examples military framework the from using of | The framework is illustrated using examples from the domain of military situation awareness. | 5,998 |
inference a algorithm provide and networks domains. stochastic language associated Bayesian modeling for | Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. | 5,999 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.