3190 search results - page 42 / 638 » cans 2011 |
132
Voted
MST
2011
14 years 7 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
131
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose the energy efficient MAC algorithm in this paper. In the proposed algorithm, each node sets the contention window size with respect to the residual energy, the harvest...
122
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper d...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
A novel framework for the factorisation of complex-valued data is derived using recent developments in complex statistics. Unlike existing factorisation tools the algorithms can c...