914 search results - page 146 / 183 » The Computational Complexity of Probabilistic Planning |
COMPLIFE
2006
Springer
14 years 18 days ago
2006
Springer
The ability to locate promoters within a section of DNA is known to be a very difficult and very important task in DNA analysis. We document an approach that incorporates the conce...
NDSS
2008
IEEE
14 years 3 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
SAC
2008
ACM
13 years 8 months ago
2008
ACM
The dominance of digital objects in today's information landscape has changed the way humankind creates and exchanges information. However, it has also brought an entirely ne...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...