The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
Bastian Ristau, Torsten Limberg, Oliver Arnold, Ge...
The volumes of data in information systems are growing drastically. The systems become increasingly complex in trying to handle heterogeneity of ubiquitous components, standards, ...
Sergiy Nikitin, Artem Katasonov, Vagan Y. Terziyan
— In this paper, we introduce a novel Markov Chain (MC) representation aided Minimum Bit Error Rate (MBER) detection method that is applicable to an M-QAM modulated SDM/SDMA upli...
—This paper presents the field-programmable gate array (FPGA) implementation of a variant of the LenstraLenstra-Lov´asz (LLL) lattice reduction (LR) algorithm, known as the Cla...
Luis G. Barbero, David L. Milliner, Tharmalingam R...