4 citations · 10 across the 11 of their papers we have counts for
Showing 2022 · cs.DSShow all
2 papers · 2 filters
cs.DS2022
Towards Better Bounds for Finding Quasi-Identifiers
Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta +1
We revisit the problem of finding small -separation keys introduced by Motwani and Xu (2008). In this problem, the input is -dimensional tuples . The goa…
cs.DS2022
Revisiting Maximum Satisfiability and Related Problems in Data Streams
Hoa T. Vu
We revisit the MaxSAT problem in the data stream model. In this problem, the stream consists of clauses that are disjunctions of literals drawn from Boolean variables. The…