• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 2024
• 
  Batya Kenig, Dan Shlomo Mizrahi:
  Enumeration of Minimal Hitting Sets Parameterized by Treewidth. CoRR abs/2408.15776 (2024)
• 2023
• 
  Batya Kenig, Nir Weinberger:
  Quantifying the Loss of Acyclic Join Dependencies. PODS 2023: 329-338
• 
  Batya Kenig:
  Ranked Enumeration of Minimal Separators. CoRR abs/2307.00604 (2023)
• 
  Batya Kenig:
  Approximate Implication for Probabilistic Graphical Models. CoRR abs/2310.13942 (2023)
• 2022
• 
  Batya Kenig, Dan Suciu:
  Integrity Constraints Revisited: From Exact to Approximate Implication. Log. Methods Comput. Sci. 18(1) (2022)
• 
  Batya Kenig, Nir Weinberger:
  Quantifying the Loss of Acyclic Join Dependencies. CoRR abs/2210.14572 (2022)
• 2021
• 
  Nofar Carmeli, Batya Kenig, Benny Kimelfeld, Markus Kröll:
  Efficiently enumerating minimal triangulations. Discret. Appl. Math. 303: 216-236 (2021)
• 
  Batya Kenig, Dan Suciu:
  A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. PODS 2021: 312-324
• 
  Batya Kenig:
  Approximate implication with d-separation. UAI 2021: 301-311
• 
  Batya Kenig:
  Approximate Implication with d-Separation. CoRR abs/2105.14463 (2021)
• 2020
• 
  Batya Kenig, Dan Suciu:
  Integrity Constraints Revisited: From Exact to Approximate Implication. ICDT 2020: 18:1-18:20
• 
  Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu:
  Mining Approximate Acyclic Schemes from Relations. SIGMOD Conference 2020: 297-312
• 
  Batya Kenig, Dan Suciu:
  A Dichotomy for the Generalized Model Counting Problem for Unions of Conjunctive Queries. CoRR abs/2008.00896 (2020)
• 2019
• 
  Batya Kenig, Benny Kimelfeld:
  Approximate Inference of Outcomes in Probabilistic Elections. AAAI 2019: 2061-2068
• 
  Batya Kenig:
  The Complexity of the Possible Winner Problem with Partitioned Preferences. AAMAS 2019: 2051-2053
• 
  Batya Kenig, Pranay Mundra, Guna Prasaad, Babak Salimi, Dan Suciu:
  Mining Approximate Acyclic Schemes from Relations. CoRR abs/1911.12933 (2019)
• 2018
• 
  Batya Kenig, Lovro Ilijasic, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
  Probabilistic Inference Over Repeated Insertion Models. AAAI 2018: 1897-1904
• 
  Uzi Cohen, Batya Kenig, Haoyue Ping, Benny Kimelfeld, Julia Stoyanovich:
  A Query Engine for Probabilistic Preferences. SIGMOD Conference 2018: 1509-1524
• 
  Batya Kenig:
  The Complexity of the Possible Winner Problem over Partitioned Preferences. CoRR abs/1802.09001 (2018)
• 
  Batya Kenig, Dan Suciu:
  Integrity Constraints Revisited: From Exact to Approximate Implication. CoRR abs/1812.09987 (2018)
• 2017
• 
  Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
  A Database Framework for Probabilistic Preferences. AMW 2017
• 
  Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
  Efficiently Enumerating Minimal Triangulations. PODS 2017: 273-287
• 
  Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich:
  Querying Probabilistic Preferences in Databases. PODS 2017: 21-36
• 2016
• 
  Batya Kenig, Avigdor Gal:
  Exploiting the Hidden Structure of Junction Trees for MPE. AAAI Workshop: Beyond NP 2016
• 
  Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
  On the Enumeration of Tree Decompositions. AMW 2016
• 
  Nofar Carmeli, Batya Kenig, Benny Kimelfeld:
  On the Enumeration of all Minimal Triangulations. CoRR abs/1604.02833 (2016)
• 2015
• 
  Batya Kenig, Avigdor Gal:
  On the Impact of Junction-Tree Topology on Weighted Model Counting. SUM 2015: 83-98
• 2013
• 
  Batya Kenig, Avigdor Gal:
  MFIBlocks: An effective blocking algorithm for entity resolution. Inf. Syst. 38(6): 908-926 (2013)
• 
  Batya Kenig, Avigdor Gal, Ofer Strichman:
  A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. SUM 2013: 219-232
• 2012
• 
  Batya Kenig, Tamir Tassa:
  A practical approximation algorithm for optimal k-anonymity. Data Min. Knowl. Discov. 25(1): 134-168 (2012)