48 search results - page 8 / 10 » Complexity of Monte Carlo Algorithms for a Class of Integral... |
CVPR
2003
IEEE
14 years 7 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...
TITB
2002
13 years 5 months ago
2002
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
SIAMSC
2010
13 years 6 days ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
PSIVT
2007
Springer
13 years 11 months ago
2007
Springer
This paper considers the problem of Bayesian inference in dynamical models with time-varying dimension. These models have been studied in the context of multiple target tracking pr...
JALC
2007
13 years 5 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...