3819 search results - page 401 / 764 » Simple Easy Terms |
186
click to vote
IACR
2011
14 years 6 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
200
click to vote
JMLR
2012
13 years 9 months ago
2012
“Energy” models for continuous domains can be applied to many problems, but often suffer from high computational expense in training, due to the need to repeatedly minimize t...
533
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
254
click to vote
AAAI
2012
13 years 9 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
301
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we are concerned with the distributed monitoring of P2P systems. We introduce the P2P Monitor system and a new declarative language, namely P2PML, for specifying mo...