15033 search results - page 348 / 3007 » Complexity Theory and Algorithms |
175
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
218
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the issue of representing coalitional games in multiagent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other ...
201
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
204
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
194
click to vote
ESORICS
2004
Springer
16 years 12 days ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...