5138 search results - page 952 / 1028 » Randomized Algorithms for 3-SAT |
101
click to vote
STOC
2009
ACM
16 years 14 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
STOC
2009
ACM
16 years 14 days 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...
123
click to vote
KDD
2008
ACM
16 years 8 days ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
RECOMB
2004
Springer
16 years 5 days ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
STOC
2007
ACM
16 years 5 days ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...