We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...
David M. Blei, Thomas L. Griffiths, Michael I. Jor...
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Abstract. In the current paper, the Promedas model for internal medicine, developed by our team, is introduced. The model is based on up-todate medical knowledge and consists of ap...
Bastian Wemmenhove, Joris M. Mooij, Wim Wiegerinck...
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...