728 search results - page 82 / 146 » Bargaining with incomplete information |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
ICA
2010
Springer
13 years 8 months ago
2010
Springer
We propose a framework for blind multiple filter estimation from convolutive mixtures, exploiting the time-domain sparsity of the mixing filters and the disjointness of the sources...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
CCR
2002
13 years 7 months ago
2002
Abstract-This paper proposes an adaptive bandwidth control algorithm that efficiently provides aggregate loss guarantee to resolve the problem of inefficient bandwidth allocation d...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...