CORR
2010
Springer
13 years 8 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--The problem of energy-efficient precoding is investigated when the terminals in the system are equipped with multiple antennas. Considering static and fast-fading multipl...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper focuses on two-cell multiple-input multiple-output (MIMO) Gaussian interfering broadcast channels (MIMO-IFBC) with K cooperating users on the cellboundary of each BS. It...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Perfect Space-Time Codes are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on cyclic division algebras, they are full-rate,...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
CORR
2010
Springer
13 years 8 months ago
2010
Springer