In this paper we propose a data intensive approach for inferring sentence-internal temporal relations, which relies on a simple probabilistic model and assumes no manual coding. W...
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
In this paper we present a probabilistic framework for tracking objects based on local dynamic segmentation. We view the segn to be a Markov labeling process and abstract it as a ...
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...