CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract— We consider power allocation algorithms for fixedrate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel stat...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—The parameterless self-organizing map (PLSOM) is a new neural network algorithm based on the self-organizing map (SOM). It eliminates the need for a learning rate and annealing ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract— In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed in both coherent and noncoherent fading channels Two recently p...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— 1 In this paper, the error performance of onoff frequency shift keying (OOFSK) modulation over fading channels is analyzed when the receiver is equipped with multiple antennas....
CORR
2007
Springer
13 years 8 months ago
2007
Springer
1 The low-SNR capacity of M-ary PSK transmission over both the additive white Gaussian noise (AWGN) and fading channels is analyzed when hard-decision detection is employed at the ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
When will the Internet wake up and become aware of itself? In this note the problem is approached by asking an alternative question: Can the Internet cope with stress? By extrapol...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...