TIT
1998
13 years 10 months ago
1998
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
JANCL
2007
13 years 10 months ago
2007
ABSTRACT. This paper provides a complete characterization of epistemic models in which distributed knowledge complies with the principle of full communication [HOE 99, GER 99]. It ...
JGT
2008
13 years 11 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
AAAI
2006
14 years 9 days ago
2006
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
CCS
2008
ACM
14 years 27 days ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...