We discuss for the concept of promises within a framework that can be applied to either humans or technology. We compare promises to the more established notion of obligations and...
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing in...
Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Ev...
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
We generalize a result in [8] and derive an asymptotic formula for entropy rate of a hidden Markov chain around a "weak Black Hole". We also discuss applications of the ...
We show that the diversity-multiplexing tradeoff of a half-duplex single-relay channel with identically distributed Rayleigh fading channel gains meets the 2 by 1 MISO bound. We ge...
Sameer Pawar, Amir Salman Avestimehr, David N. C. ...
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The ch...