Sciweavers

323 search results - page 27 / 65
» An Importance Sampling Algorithm Based on Evidence Pre-propa...
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
SVD based Kalman particle filter for robust visual tracking
Object tracking is one of the most important tasks in computer vision. The unscented particle filter algorithm has been extensively used to tackle this problem and achieved a grea...
Qingdi Wei, Weiming Hu, Xi Li, Xiaoqin Zhang, Yang...
SAC
2008
ACM
13 years 7 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
ICML
2008
IEEE
14 years 8 months ago
An object-oriented representation for efficient reinforcement learning
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
Carlos Diuk, Andre Cohen, Michael L. Littman
CGF
2006
94views more  CGF 2006»
13 years 7 months ago
Optimizing Control Variate Estimators for Rendering
We present the Optimizing Control Variate (OCV) estimator, a new estimator for Monte Carlo rendering. Based upon a deterministic sampling framework, OCV allows multiple importance...
Shaohua Fan, Stephen Chenney, Bo Hu, Kam-Wah Tsui,...
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim