157 search results - page 17 / 32 » SLIDE: A Useful Special Case of the CARDPATH Constraint |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
POLICY
2004
Springer
14 years 2 months ago
2004
Springer
We study the specification of access control policy in large-scale distributed systems. Our work on real-world policies has shown that standard policy idioms such as role hierarc...
IAJIT
2010
13 years 7 months ago
2010
: Routing is the process of forwarding data across an inter-network from a designated source to a final destination. Along the way from source to destination, at least one intermed...
DCC
2003
IEEE
14 years 8 months ago
2003
IEEE
Embedded computing systems are space and cost sensitive; memory is one of the most restricted resources, posing serious constraints on program size. Code compression, which is a s...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...