Sciweavers

871 search results - page 75 / 175
» Factorized Local Appearance Models
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 11 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CVPR
1999
IEEE
15 years 3 days ago
Explaining Optical Flow Events with Parameterized Spatio-Temporal Models
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
Michael J. Black
WWW
2005
ACM
14 years 3 months ago
A more precise model for web retrieval
Most research works on web retrieval latency are object-level based, which we think is insufficient and sometimes inaccurate. In this paper, we propose a fine grained operation-le...
Junli Yuan, Hung Chi, Qibin Sun
IJCNN
2006
IEEE
14 years 4 months ago
Implementing Synaptic Plasticity in a VLSI Spiking Neural Network Model
— This paper describes an area-efficient mixed-signal implementation of synapse-based long term plasticity realized in a VLSI1 model of a spiking neural network. The artificial...
Johannes Schemmel, Andreas Grübl, Karlheinz M...
CSREASAM
2006
13 years 11 months ago
Modeling Role-based Trust and Authority in Open Environments
Trust and authority are essential components that must be factored in designing and implementing a distributed access control mechanism for open environments. This paper presents ...
Dongwan Shin