Sciweavers

CORR
2008
Springer
52views Education» more  CORR 2008»
13 years 8 months ago
A static theory of promises
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...
Jan A. Bergstra, Mark Burgess
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 8 months ago
Welfare Undominated Groves Mechanisms
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...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 8 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
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...
Nir Ailon
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 8 months ago
On the Throughput Maximization in Dencentralized Wireless Networks
Jamshid Abouei, Alireza Bayesteh, Masoud Ebrahimi,...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Non-Negative Matrix Factorization, Convexity and Isometry
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...
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 8 months ago
Structural abstract interpretation, A formal study using Coq
al abstract interpretation A formal study using Coq Yves Bertot INRIA Sophia-M
Yves Bertot
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
A simple local 3-approximation algorithm for vertex cover
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...
Valentin Polishchuk, Jukka Suomela
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 8 months ago
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains
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 ...
Guangyue Han, Brian Marcus
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel
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. ...
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 8 months ago
On characterising strong bisimilarity in a fragment of CCS with replication
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...
Daniel Hirschkoff, Damien Pous