Sciweavers

410 search results - page 43 / 82
» A Fast Method for Local Penetration Depth Computation
Sort
View
CVIU
2011
13 years 3 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
UAI
2000
13 years 10 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
BMCBI
2010
151views more  BMCBI 2010»
13 years 8 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
TITB
2010
138views Education» more  TITB 2010»
13 years 3 months ago
Local structure-based region-of-interest retrieval in brain MR images
The aging population and the growing amount of medical data have increased the need for automated tools in the neurology departments. Although the researchers have been developing ...
Devrim Unay, Ahmet Ekin, Radu S. Jasinschi
FGR
2004
IEEE
170views Biometrics» more  FGR 2004»
14 years 12 days ago
3D Shape Constraint for Facial Feature Localization Using Probabilistic-like Output
This paper presents a method to automatically locate facial feature points under large variations in pose, illumination and facial expressions. First we propose a method to calcul...
Longbin Chen, Lei Zhang, HongJiang Zhang, Mohamed ...