Sciweavers

993 search results - page 22 / 199
» The Complexity of Probabilistic EL
Sort
View
IJAR
2007
96views more  IJAR 2007»
13 years 7 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 8 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ACII
2005
Springer
14 years 1 months ago
Generalization of a Vision-Based Computational Model of Mind-Reading
This paper describes a vision-based computational model of mind-reading that infers complex mental states from head and facial expressions in real-time. The generalization ability ...
Rana El Kaliouby, Peter Robinson
BMVC
2000
13 years 9 months ago
Fast Computation of a Boundary Preserving Estimate of Optical Flow
In this study we seek a fast method for robust, boundary preserving estimation of optical flow. Several studies have addressed this topic and proposed methods that account for vel...
Rosario El-Feghali, Amar Mitiche