Programs typically make extensive use of libraries, including dynamically linked libraries, which are often not available in source-code form, and hence not analyzable by tools tha...
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Many Internet applications employ multi-tier software architectures. The performance of such multi-tier Internet applications is typically measured by the end-toend response times...
We introduce factored language models (FLMs) and generalized parallel backoff (GPB). An FLM represents words as bundles of features (e.g., morphological classes, stems, data-drive...