In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Our research is motivated by the scaleability, availability, and extensibility challenges in deploying open systems based, enterprise operational applications. We present Delta...
Van Oleson, Karsten Schwan, Greg Eisenhauer, Beth ...
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
The development of natural language proccssing (NLP) systems that perform machine translation (MT) and information retrieval (IR) has highlighted the need for the automatic recogn...
The record of successful applications of formal verification techniques is slowly growing. Our ultimate aim, however, is not to perform small pilot projects that show that verific...