Sciweavers

1712 search results - page 264 / 343
» A Computational Approach to Binding Theory
Sort
View
CVPR
2010
IEEE
14 years 11 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
ICMI
2010
Springer
220views Biometrics» more  ICMI 2010»
14 years 11 months ago
Visual speech synthesis by modelling coarticulation dynamics using a non-parametric switching state-space model
We present a novel approach to speech-driven facial animation using a non-parametric switching state space model based on Gaussian processes. The model is an extension of the shar...
Salil Deena, Shaobo Hou, Aphrodite Galata
ACCV
2010
Springer
14 years 8 months ago
Modeling Sense Disambiguation of Human Pose: Recognizing Action at a Distance by Key Poses
Abstract. We propose a methodology for recognizing actions at a distance by watching the human poses and deriving descriptors that capture the motion patterns of the poses. Human p...
Snehasis Mukherjee, Sujoy Kumar Biswas, Dipti Pras...
CN
2011
117views more  CN 2011»
14 years 8 months ago
Cross-layer design in multihop wireless networks
In this paper, we take a holistic approach to the protocol architecture design in multihop wireless networks. Our goal is to integrate various protocol layers into a rigorous fram...
Lijun Chen, Steven H. Low, John C. Doyle
115
Voted
JCST
2010
189views more  JCST 2010»
14 years 8 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar