A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
— In this paper, we consider minimum bit error rate (BER) beamforming (BF) for multiple–input multiple–output orthogonal frequency division multiplexing (MIMO–OFDM) systems...
Yang-wen Liang, Robert Schober, Wolfgang H. Gersta...
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
Arne Meier, Martin Mundhenk, Michael Thomas, Herib...
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
— In this paper we investigate a realistic code acquisition assisted cooperative Non-Coherent (NC) Multiple-Input Multiple-Output (MIMO) DS-CDMA downlink scenario, when communica...