Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Mining for outliers in sequential databases is crucial to forward appropriate analysis of data. Therefore, many approaches for the discovery of such anomalies have been proposed. ...
We propose an approach for timing analysis of software-based embedded computer systems that builds on the established probabilistic framework of Bayesian networks. We envision an ...
In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...