5100 search results - page 48 / 1020 » The Linear Complexity of a Graph |
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
ICA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
COMCOM
2011
13 years 2 months ago
2011
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract— In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...
MFCS
1992
Springer
13 years 12 months ago
1992
Springer
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...