Sciweavers

13621 search results - page 160 / 2725
» Computability and Complexity in Self-assembly
Sort
View
BMVC
2000
15 years 7 months ago
Fast Computation of a Boundary Preserving Estimate of Optical Flow
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...
Rosario El-Feghali, Amar Mitiche
JCIT
2010
158views more  JCIT 2010»
15 years 1 months ago
Improvement of a Secure Convex Hull Two-Party Computation Protocol
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
Wenjie Zhao, Mingxing He
AB
2008
Springer
16 years 24 days ago
On the Computational Power of Biochemistry
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
Luca Cardelli, Gianluigi Zavattaro
ACII
2005
Springer
16 years 9 hour ago
Generalization of a Vision-Based Computational Model of Mind-Reading
This paper describes a vision-based computational model of mind-reading that infers complex mental states from head and facial expressions in real-time. The generalization ability ...
Rana El Kaliouby, Peter Robinson
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
15 years 12 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai