41 search results - page 8 / 9 » Conditional hardness for satisfiable 3-CSPs |
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
ICSE
2008
IEEE-ACM
14 years 7 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
KDD
2003
ACM
14 years 6 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
PODS
2008
ACM
14 years 6 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...