Sciweavers

113 search results - page 10 / 23
» Independence concepts in evidence theory
Sort
View
SUM
2007
Springer
14 years 3 months ago
Combining Uncertain Outputs from Multiple Ontology Matchers
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
Ying Wang, Weiru Liu, David A. Bell
AI
2002
Springer
13 years 9 months ago
Learning Bayesian networks from data: An information-theory based approach
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
14 years 7 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
RR
2009
Springer
14 years 4 months ago
Belief Logic Programming with Cyclic Dependencies
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches ...
Hui Wan
CIE
2008
Springer
13 years 11 months ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa