459 search results - page 62 / 92 » Computational Complexity of Probabilistic Disambiguation |
ICPR
2002
IEEE
16 years 26 days ago
2002
IEEE
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
CGF
2004
14 years 11 months ago
2004
Crowd simulation for virtual environments offers many challenges centered on the trade-offs between rich behavior, control and computational cost. In this paper we present a new a...
153
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
JELIA
2004
Springer
15 years 5 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...