16666 search results - page 351 / 3334 » Descriptive and Computational Complexity |
163
click to vote
CCA
2005
Springer
15 years 8 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
135
click to vote
BMVC
2000
15 years 8 months ago
2000
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...
189
click to vote
JCIT
2010
15 years 1 months ago
2010
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...
210
click to vote
AB
2008
Springer
16 years 1 months ago
2008
Springer
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...
160
Voted
ACII
2005
Springer
16 years 9 days ago
2005
Springer
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 ...