Sciweavers

364 search results - page 20 / 73
» Belief Update Using Graphs
Sort
View
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
13 years 10 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 10 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
EUSFLAT
2009
121views Fuzzy Logic» more  EUSFLAT 2009»
13 years 8 months ago
A New Conditioning Rule, Its Generalization and Evidential Reasoning
- In Evidence theory, several conditioning rules for updating belief have been proposed, including Dempster's rule of conditioning. The paper views the conditioning rules prop...
Koichi Yamada, Vilany Kimala, Muneyuki Unehara
CCS
2007
ACM
14 years 4 months ago
Toward measuring network security using attack graphs
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
Lingyu Wang, Anoop Singhal, Sushil Jajodia
ICSM
2009
IEEE
14 years 5 months ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao