Sciweavers

282 search results - page 52 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
AAAI
2010
13 years 9 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
ICCV
2003
IEEE
14 years 9 months ago
Fast Pose Estimation with Parameter-Sensitive Hashing
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
Gregory Shakhnarovich, Paul A. Viola, Trevor Darre...
ECCV
2006
Springer
14 years 9 months ago
Monocular Tracking of 3D Human Motion with a Coordinated Mixture of Factor Analyzers
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
Rui Li, Ming-Hsuan Yang, Stan Sclaroff, Tai-Peng T...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
ICCV
2005
IEEE
14 years 9 months ago
Building a Classification Cascade for Visual Identification from One Example
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...