6142 search results - page 538 / 1229 » The Complexity of Partition Functions |
196
click to vote
PODC
2004
ACM
16 years 14 days ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
161
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Recognition of binding sites in proteins is a direct computational approach to the characterization of proteins in terms of biological and biochemical function. Residu...
224
click to vote
IACR
2011
14 years 6 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
182
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
229
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...