We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...