13784 search results - page 326 / 2757 » On Computing Functions with Uncertainty |
182
click to vote
HRI
2007
ACM
15 years 10 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
155
click to vote
ASIACRYPT
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
178
click to vote
SI3D
2006
ACM
16 years 18 days ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
194
click to vote
CGF
2004
15 years 6 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
178
click to vote
EUROCRYPT
2011
Springer
14 years 10 months ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...