Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
Benjamin Taskar, Ming Fai Wong, Pieter Abbeel, Dap...
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...