544 search results - page 13 / 109 » What cannot be computed locally! |
89
Voted
DAGM
2003
Springer
15 years 5 months 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...
102
Voted
EUROCRYPT
2004
Springer
15 years 5 months 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...
97
Voted
AICOM
2002
15 years 10 days 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...
94
Voted
ECCC
2007
15 years 13 days 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...
96
Voted
CGF
2000
15 years 9 days 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 ...