12101 search results - page 49 / 2421 » Mutual Information Analysis |
PODC
1999
ACM
14 years 1 months ago
1999
ACM
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
NIPS
2003
13 years 10 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
NIPS
1994
13 years 10 months ago
1994
A new learning algorithmis derived which performs online stochastic gradient ascent in the mutual informationbetween outputs and inputs of a network. In the absence of a priori kn...