436 search results - page 14 / 88 » Decomposing constraint systems: equivalences and computation... |
ACL
2012
11 years 11 months ago
2012
For sentence compression, we propose new semantic constraints to directly capture the relations between a predicate and its arguments, whereas the existing approaches have focused...
EUROCRYPT
1998
Springer
14 years 24 days ago
1998
Springer
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
ESORICS
2005
Springer
14 years 2 months ago
2005
Springer
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...
DSN
2002
IEEE
14 years 1 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
We investigate the universal characteristics of the simulated time horizon of the basic conservative parallel algorithm when implemented on regular lattices. This technique [1, 2]...