2168 search results - page 209 / 434 » Randomized Algorithms and Complexity Theory |
149
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
114
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
122
click to vote
DIALM
2004
ACM
15 years 9 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
143
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
194
click to vote
AAAI
2011
14 years 3 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...