Sciweavers

198 search results - page 35 / 40
» Domain equations for probabilistic processes
Sort
View
WWW
2002
ACM
14 years 9 months ago
Learning to map between ontologies on the semantic web
Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated info...
AnHai Doan, Jayant Madhavan, Pedro Domingos, Alon ...
VLDB
2003
ACM
165views Database» more  VLDB 2003»
14 years 9 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
14 years 13 days ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
FLAIRS
2001
13 years 10 months ago
A Method for Evaluating Elicitation Schemes for Probabilities
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if ...
Haiqin Wang, Denver Dash, Marek J. Druzdzel
TOG
2010
134views more  TOG 2010»
13 years 3 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...