Sciweavers

1940 search results - page 101 / 388
» Graph Transformation with Variables
Sort
View
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
15 years 8 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
ICAI
2010
15 years 1 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 3 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
15 years 1 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
SUM
2009
Springer
15 years 9 months ago
Modeling Unreliable Observations in Bayesian Networks by Credal Networks
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
Alessandro Antonucci, Alberto Piatti