We propose a corpus-based probabilistic framework to extract hidden common syntax across languages from non-parallel multilingual corpora in an unsupervised fashion. For this purp...
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...
Abstract. We present a new approach to biometrics that makes probabilistic inferences about matching without ever estimating an identity "template". The biometric data is...
Simon J. D. Prince, Jania Aghajanian, Umar Mohamme...