436 search results - page 14 / 88 » Decomposing constraint systems: equivalences and computation... |
105
click to vote
ACL
2012
13 years 3 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...
106
click to vote
EUROCRYPT
1998
Springer
15 years 5 months 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...
100
click to vote
ESORICS
2005
Springer
15 years 7 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...
119
click to vote
DSN
2002
IEEE
15 years 6 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...
103
click to vote
SAC
2002
ACM
15 years 1 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]...