Sciweavers

CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 7 months ago
Performance Analysis for Multichannel Reception of OOFSK Signaling
— 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....
Qingyun Wang, Mustafa Cenk Gursoy
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection
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 ...
Mustafa Cenk Gursoy
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 7 months ago
Can the Internet cope with stress?
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...
Andreas Martin Lisewski
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 7 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: 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...
Pierre-Francois Marteau, Gildas Ménier
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 7 months ago
Frugal Colouring of Graphs
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...
Omid Amini, Louis Esperet, Jan van den Heuvel
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 7 months ago
Periodicity of certain piecewise affine planar maps
We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for λ ∈ { ±1± √ 5 2 , ± √ 2, ± √ 3} that...
Shigeki Akiyama, Horst Brunotte, Attila Pethö...
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 months ago
An algebraic generalization of Kripke structures
Sérgio Marcelino, Pedro Resende
CORR
2007
Springer
52views Education» more  CORR 2007»
13 years 7 months ago
Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen
Marie Cottrell, Smaïl Ibbou, Patrick Letr&eac...
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
A Note on Ontology and Ordinary Language
We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure...
Walid S. Saba