Sciweavers

19320 search results - page 319 / 3864
» On the complexity of computing determinants
Sort
View
NN
2006
Springer
234views Neural Networks» more  NN 2006»
15 years 6 months ago
Attention in natural scenes: Neurophysiological and computational bases
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
Edmund T. Rolls, Gustavo Deco
CCA
2005
Springer
15 years 8 months ago
Computable Versions of Basic Theorems in Functional Analysis
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...
Atsushi Yoshikawa, Mariko Yasugi
BMVC
2000
15 years 8 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 1 months 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