459 search results - page 28 / 92 » Computational Complexity of Probabilistic Disambiguation |
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper introduces a Bayesian filter that is specifically designed for counting targets that move outside of the field of view while performing a sensor sweep. Informatio...
IEEEICCI
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...
112
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper presents a novel method to model and recognize human faces in video sequences. Each registered person is represented by a low-dimensional appearance manifold in the amb...
105
click to vote
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
102
Voted
CONCUR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...