15073 search results - page 266 / 3015 » Probabilistic algorithms for computing resultants |
145
Voted
CGF
2008
15 years 4 months ago
2008
This paper presents a novel method that effectively combines both control variates and importance sampling in a sequential Monte Carlo context. The radiance estimates computed dur...
171
click to vote
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
121
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...
126
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
We treat feature selection and basis selection in a unified framework by introducing the masking matrix. If one considers feature selection as finding a binary mask vector that de...
138
Voted
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...