131 search results - page 20 / 27 » The complexity of constructing pseudorandom generators from ... |
CP
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
NIPS
1993
13 years 9 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
CRYPTO
2010
Springer
13 years 8 months ago
2010
Springer
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...
ISOLA
2010
Springer
13 years 6 months ago
2010
Springer
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
SIGMOD
2010
ACM
14 years 14 days ago
2010
ACM
The proliferation of knowledge-sharing communities and the advances in information extraction have enabled the construction of large knowledge bases using the RDF data model to re...