Batya Kenig
YOU?
Author Swipe
View article: Connectivity-Preserving Minimum Separator in AT-free Graphs
Connectivity-Preserving Minimum Separator in AT-free Graphs Open
Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\subseteq V(G)$ t…
View article: Approximate Implication for Probabilistic Graphical Models
Approximate Implication for Probabilistic Graphical Models Open
The graphical structure of Probabilistic Graphical Models (PGMs) represents the conditional independence (CI) relations that hold in the modeled distribution. Every separator in the graph represents a conditional independence relation in t…
View article: Enumeration of Minimal Hitting Sets Parameterized by Treewidth
Enumeration of Minimal Hitting Sets Parameterized by Treewidth Open
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data management applications that include constraint mining, discovering unique column combinations, and enumerating database repairs. Previously, Eiter…
View article: Approximate Implication for Probabilistic Graphical Models
Approximate Implication for Probabilistic Graphical Models Open
The graphical structure of Probabilistic Graphical Models (PGMs) represents the conditional independence (CI) relations that hold in the modeled distribution. Every separator in the graph represents a conditional independence relation in t…
View article: Listing Small Minimal $s,t$-separators in FPT-Delay
Listing Small Minimal $s,t$-separators in FPT-Delay Open
Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $s,t$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We present an algorithm for listi…
View article: Quantifying the Loss of Acyclic Join Dependencies
Quantifying the Loss of Acyclic Join Dependencies Open
Acyclic schemes posses known benefits for database design, speeding up queries, and reducing space requirements. An acyclic join dependency (AJD) is lossless with respect to a universal relation if joining the projections associated with t…
View article: Listing Minimal Vertex Cutsets in Ranked Order
Listing Minimal Vertex Cutsets in Ranked Order Open
Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $st$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We consider the problem of listing…
View article: Integrity Constraints Revisited: From Exact to Approximate Implication
Integrity Constraints Revisited: From Exact to Approximate Implication Open
Integrity constraints such as functional dependencies (FD) and multi-valued dependencies (MVD) are fundamental in database schema design. Likewise, probabilistic conditional independences (CI) are crucial for reasoning about multivariate p…
View article: Enumerating Minimal Separators in Ranked Order
Enumerating Minimal Separators in Ranked Order Open
Let $G$ be an $n$-vertex graph, and $s,t$ vertices of $G$. We present an efficient algorithm which enumerates the set of minimal $st$-separators of $G$ in ascending order of cardinality, with a delay of $O(n^{3.5})$ per separator. In parti…
View article: Approximate Implication with d-Separation
Approximate Implication with d-Separation Open
The graphical structure of Probabilistic Graphical Models (PGMs) encodes the conditional independence (CI) relations that hold in the modeled distribution. Graph algorithms, such as d-separation, use this structure to infer additional cond…
View article: A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries
A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries Open
We study the $generalized~model~counting~problem$, defined as follows: given a database, and a set of deterministic tuples, count the number of subsets of the database that include all deterministic tuples and satisfy the query. This probl…
View article: Mining Approximate Acyclic Schemes from Relations
Mining Approximate Acyclic Schemes from Relations Open
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 learning algorithms. Multivalued dependencies (MVDs) are th…
View article: Integrity Constraints Revisited: From Exact to Approximate Implication
Integrity Constraints Revisited: From Exact to Approximate Implication Open
Integrity constraints such as functional dependencies (FD), and multi-valued dependencies (MVD) are fundamental in database schema design. Likewise, probabilistic conditional independences (CI) are crucial for reasoning about multivariate …
View article: Mining Approximate Acyclic Schemes from Relations
Mining Approximate Acyclic Schemes from Relations Open
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 learning algorithms. Multivalued dependencies (MVDs) are th…
View article: Approximate Inference of Outcomes in Probabilistic Elections
Approximate Inference of Outcomes in Probabilistic Elections Open
We study the complexity of estimating the probability of an outcome in an election over probabilistic votes. The focus is on voting rules expressed as positional scoring rules, and two models of probabilistic voters: the uniform distributi…
View article: A Query Engine for Probabilistic Preferences
A Query Engine for Probabilistic Preferences Open
Models of uncertain preferences, such as Mallows, have been extensively studied due to their plethora of application domains. In a recent work, a conceptual and theoretical framework has been proposed for supporting uncertain preferences a…
View article: Probabilistic Inference Over Repeated Insertion Models
Probabilistic Inference Over Repeated Insertion Models Open
Distributions over rankings are used to model user preferences in various settings including political elections and electronic commerce. The Repeated Insertion Model (RIM) gives rise to various known probability distributions over ranking…
View article: The Complexity of the Possible Winner Problem over Partitioned Preferences
The Complexity of the Possible Winner Problem over Partitioned Preferences Open
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 winner. In this work, we consider the computational complex…
View article: Efficiently Enumerating Minimal Triangulations
Efficiently Enumerating Minimal Triangulations Open
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where "…
View article: On the Enumeration of all Minimal Triangulations
On the Enumeration of all Minimal Triangulations Open
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the tree decompositions, in incremental polynomial time, where proper …