3 papers
cs.AI2021
Approximate Implication with d-Separation
Batya Kenig
The graphical structure of Probabilistic Graphical Models (PGMs) encodes the conditional independence (CI) relations that hold in the modeled distribution. Graph algorithms, such a…
cs.DB2019
Mining Approximate Acyclic Schemes from Relations
Batya Kenig, Pranay Mundra, Guna Prasad +2
Acyclic schemes have numerous applications in databases and in machine learning, such as improved design, more efficient storage, and increased performance for queries and machine…
cs.GT2018
The Complexity of the Possible Winner Problem over Partitioned Preferences
Batya Kenig
The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a…