5100 search results - page 609 / 1020 » The Linear Complexity of a Graph |
169
click to vote
TIT
2008
15 years 6 months ago
2008
A new wavelet-based methodology for representing data on regular grids is introduced and studied. The main attraction of this new L-CAMP methodology is in the way it scales with th...
140
click to vote
TSP
2008
15 years 6 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
165
click to vote
TWC
2008
15 years 6 months ago
2008
In this paper, we investigate the application of nonbinary low-density parity-check (LDPC) cycle codes over Galois field GF(q) to multiple-input multiple-output (MIMO) channels. Tw...
173
click to vote
JASSS
2002
15 years 6 months ago
2002
What is the degree of sophistication that we have to put into the agents in agents based computer simulation models? Should we provide them with a "mind"? The answer ran...
173
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...