Querying Probabilistic Preferences in Databases
Batya Kenig, Benny Kimelfeld, Haoyue Ping and Julia Stoyanovich PODS’17: Proceedings of the 36th ACM Symposium on Principles of Database Systems PDFΙ PPT
Efficiently Enumerating Minimal Triangulations
Nofar Carmeli, Batya Kenig and Benny Kimelfeld PODS’17: Proceedings of the 36th ACM Symposium on Principles of Database Systems PDFΙ PPT
Exploiting the Hidden Structure of Junction Trees for MPE
Batya Kenig and Avigdor Gal AAAI’16 workshop: Beyond NP PDF
A Probabilistic Graphical Model for Mallows Preferences
Batya Kenig and Benny Kimelfeld IJCAI’16 workshop: The 10th Workshop on Advances in Preference Handling (MPREF) PDF
On the Impact of Junction-Tree Topology on Weighted Model Counting
Batya Kenig and Avigdor Gal SUM’15: 9th International Conference on Scalable Uncertainty Management PDFΙ PPT
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time
Batya Kenig, Avigdor Gal and Ofer Strichman SUM’13: 7th International Conference on Scalable Uncertainty Management PDFΙ PPT
MFIBlocks: An effective blocking algorithm for entity resolution
Batya Kenig and Avigdor Gal Information Systems, Vol. 38(6) (2013), pp. 908-926 (2013)PDF
A practical approximation algorithm for optimal k-anonymity
Batya Kenig and Tamir Tassa Data Mining and Knowledge Discovery, Vol. 25 (2012), pp. 134-168 PDF
