18 search results - page 3 / 4 » On the Approximation Resistance of a Random Predicate |
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
DASFAA
2009
IEEE
14 years 17 days ago
2009
IEEE
In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Qe = Pi(Pi ∈ P1, P2, . . . , Pm), which permits only one predicate to be selec...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...