11160 search results - page 409 / 2232 » Incompleteness in a General Setting |
168
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically ...
203
click to vote
NIPS
2003
15 years 8 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
171
click to vote
NIPS
2007
15 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
151
click to vote
ATAL
2005
Springer
16 years 13 days ago
2005
Springer
This paper aims at proposing a general formal framework for dialogue between autonomous agents which are looking for a common agreement about a collective choice. The proposed set...
153
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...