Sciweavers

1199 search results - page 137 / 240
» Graph Theory
Sort
View
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 5 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
SIMPRA
2008
137views more  SIMPRA 2008»
15 years 3 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
TBILLC
2007
Springer
15 years 10 months ago
Expressing Belief Flow in Assertion Networks
In the line of some earlier work done on belief dynamics, we an abstract model of belief propagation on a graph based on the methodology of the revision theory of truth. A modal la...
Sujata Ghosh, Fernando R. Velázquez-Quesada
FOCS
2003
IEEE
15 years 9 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
NIPS
2000
15 years 5 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck