We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...