544 search results - page 13 / 109 » What cannot be computed locally! |
DAGM
2003
Springer
14 years 21 days ago
2003
Springer
Automatic unloading of piled boxes of unknown dimensions is undoubtedly of great importance to the industry. In this contribution a system addressing this problem is described: a l...
EUROCRYPT
2004
Springer
14 years 26 days ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
AICOM
2002
13 years 7 months ago
2002
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
ECCC
2007
13 years 7 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
CGF
2000
13 years 7 months ago
2000
Now that technology allows us to present photorealistic animations of scenically lit objects acting in realtime, the problem of computer graphics has changed from making displays ...