Let G be an undirected graph, and s,t distinguished vertices of G. A
min...
Acyclic schemas possess known benefits for database design, speeding up
...
Let G be an n-vertex graph, and s,t vertices of G. We present an
efficie...
The graphical structure of Probabilistic Graphical Models (PGMs) encodes...
We study the generalized model counting problem, defined as follows: giv...
Acyclic schemes have numerous applications in databases and in machine
l...
Integrity constraints such as functional dependences (FD), and multi-val...
The Possible-Winner problem asks, given an election where the voters'
pr...